#include<bits/stdc++.h> using namespace std; int num,a[10001]={1},n; inline void print(int t) { cout<<n<<"="; num+=1; for(int i=1;i<=t-1;++i) cout<<a[i]<<"+"; cout<<a[t]<<endl; } inline void dfs(int s,int t) { for(int i=a[t-1];i<=s;++i) if(i<n) { a[t]=i, s-=i; (s==0)?print(t):dfs(s,t+1); s+=i; } } signed main() { cin>>n; dfs(n,1); cout<<num; return 0; }