#include <cstdio>#include <cstdlib>#include <iostream>#include <string.h>#include <queue>#include <stack>#include <math.h>#include <algorithm>#include <limits.h>#define MAX 110using namespace std;typedef struct MAP{int out[MAX];int len;}MAP;int n;int ans[MAX][MAX];int l[MAX];queue<MAP> q;void BFS(){int i,k;for(i=1; i<MAX; i++)l[i] = 5000;MAP a;a.len = 1;a.out[0] = 1;l[1] = 1;q.push(a);ans[1][0] = 1;while( !q.empty() ){MAP tmp = q.front();int out[MAX];memcpy(out,tmp.out,sizeof(tmp.out));q.pop();for(i=0; i<tmp.len; i++)for(k=i; k<tmp.len; k++)if( tmp.len+1 <= l[out[i]+out[k]] && out[i] + out[k] < MAX ){MAP b;memcpy(b.out,tmp.out,sizeof(tmp.out));b.out[tmp.len] = out[i]+out[k];memcpy(ans[out[i]+out[k]],b.out,sizeof(b.out));b.len = tmp.len+1;l[out[i]+out[k]] = b.len;q.push(b);}}}int main(){int i,len;BFS();while( ~scanf("%d",&n) && n ){len = l[n];printf("%d",ans[n][0]);for(i=1; i<len; i++)printf(" %d",ans[n][i]);printf("n");}return 0;}
