#include<bits/stdc++.h>
using namespace std;
long long n,a[105],b[105];
int main(){
    freopen("binomial.in","r",stdin);
    freopen("binomial.out","w",stdout);
   cin>>n;
   if(n==0){
       cout<<1;return 0;
   }
   if(n==1){
       cout<<"a+b";
       return 0;
   }
   int cnt=2;
   a[1]=1;a[2]=1;
   for(int i=2;i<=n;i++){
       int j=1;
       while(j<=cnt+1){
           b[j]=a[j-1]+a[j];
           j++;
       }
       cnt++;
       int t=1;
       while(t<=cnt){
           a[t]=b[t];
           t++;
       }
   }
   cout<<"a^"<<n;
   for(int i=2;i<cnt;i++){
       cout<<"+";
       cout<<a[i]<<"a";
       if(n+1-i!=1){
           cout<<"^"<<n+1-i;
       }cout<<"b";
       if(n-(n+1-i)!=1){
           cout<<"^"<<n-(n+1-i);
       }
   }
   cout<<"+b^"<<n;
    return 0;
}