#include <stdio.h>

#include<iostream>

#include <string.h>

#include<memory.h>

using namespace std;

const int N = ;

int n = ;

int ans[N] = {  };

int depth = ;

int flag = ;

void dfs(int cur)

{

    if(flag)

        return;

    if(cur == depth)

    {

        if(ans[cur] == n)

            flag = ;

        return;

    }

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

    {

        for(int j = i; j <= cur; j++)

        {

            if(ans[i] + ans[j] > ans[cur] && ans[i] + ans[j] <= n)

            {

                int sum = ans[i] + ans[j];

                for(int k = cur + ; k <= depth; k++)

                    sum = sum * ;

                if(sum < n)

                    continue;

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

                dfs(cur + );

                if(flag)

                    return;

            }

        }

    }

}

int main()

{

    freopen("d://1.txt", "r", stdin);

    while (cin >> n && n)

    {

        memset(ans, , sizeof(ans));

        ans[] = ;

        int k = ;

        depth = ;

        flag = ;

        while (k < n)

        {

            ++depth;

            k = k * ;

        }

        while (!flag)

        {

            dfs();

            if(!flag)

                ++depth;

        }

        cout << ans[];

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

            cout << " " << ans[i];

        cout << endl;

    }

    return ;

}