#include<cstdio>
#define N 65
#define ll long long
using namespace std;
int n;ll d[N][N];
void pu(char c,int x)
{
    if(!x)return;
    printf("%c",c);
    if(x>1)printf("^%d",x);
}
int main()
{
    freopen("binomial.in","r",stdin);freopen("binomial.out","w",stdout);
    scanf("%d",&n);
    if(!n)return !printf("1");
    for(int i=0;i<=n;i++)
    {
        d[i][0]=d[i][i]=1;
        for(int j=1;j<i;j++)d[i][j]=d[i-1][j-1]+d[i-1][j];
    }
    for(int i=0;i<=n;i++)
    {
        if(i)printf("+");
        if(d[n][i]^1)printf("%lld",d[n][i]);
        pu('a',n-i);pu('b',i);
    }
    return 0;
}