#include <algorithm>

#include <bitset>

#include <cctype>

#include <cerrno>

#include <clocale>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <limits>

#include <list>

#include <map>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <iostream>

#include <istream>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <utility>

#include <vector>

#include <cwchar>

#include <cwctype>

#include <stack>

#include <limits.h>

using namespace std;

int i,n,step;

int ans[];

inline bool dfs(int dep)

{

        int i,j;

        bool visited[];

        if (dep > step)

        {

                if (ans[step] == n) return true;

                else return false;

        }    else

        {

                memset(visited,false,sizeof(visited));

                for (i = dep - ; i >= ; i--)

                {

                        for (j = i; j >= ; j--)

                        {

                                if (ans[i] + ans[j] <= ans[i-]) break;

                                if (ans[i] + ans[j] > n || visited[ans[i]+ans[j]]) continue;

                                visited[ans[i]+ans[j]] = true;

                                ans[dep] = ans[i] + ans[j];

                                if (dfs(dep+)) return true;

                        }

                }

                return false;

        }

}

int main()

{

        while (scanf("%d",&n) != EOF && n)

        {

                ans[] = ;

                for (i = ; i <= ; i++)

                {

                        step = i;

                        if (dfs()) break;

                }

                for (i = ; i <= step; i++) printf("%d ",ans[i]);

                printf("\n");

        }

        return ;

}