#include<iostream> 
using namespace std;
long long ls[80][80];
int main(){
    freopen("binomial.in","r",stdin);
    freopen("binomial.out","w",stdout);
    
    int n;scanf("%d",&n);
    
    if(n==0){
        printf("1");
        return 0;
    }else if(n==1){
        printf("a+b");
        return 0;
    }
    
    ls[0][1]=1ll;
    for(int p=1;p<=n;p++){
        ls[p][1]=1ll;
        for(int i=2;i<=p;i++) ls[p][i]=ls[p-1][i]+ls[p-1][i-1];
        ls[p][p+1]=1ll;
    }
    
    printf("a^%d",n);
    
    for(int i=1;i<n;i++){
        int a=n-i;
        int b=i;
        printf("+%lld",ls[n][i+1]);
        if(a!=0){
            printf("a");
            if(a!=1) printf("^%d",a);
        }
        if(b!=0){
            printf("b");
            if(b!=1) printf("^%d",b);
        }
    }
    
    printf("+b^%d",n);
    
    
    return 0;
}