#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <cmath>
#define LL long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
#define BitCount(x) __builtin_popcount(x)
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const int MAXN = 10000 + 10;
const int MOD = 1e9 + 7;
 
typedef pair<int, int> pii;
typedef vector<int>::iterator viti;
typedef vector<pii>::iterator vitii;
 
int target, ans[MAXN];
 
bool DFS(int curPos, int depth)
{
    if (curPos > depth) return false;
    if (ans[curPos - 1] << (depth - curPos + 1) < target || ans[curPos - 1] + ans[curPos - 2] > target) return false;
    for (int i = 1; i < curPos; i++)
    {
        ans[curPos] = ans[curPos - 1] + ans[i];
        if (curPos == depth && ans[curPos] == target) return true;
        if (DFS(curPos + 1, depth)) return true;
    }
    return false;
}
 
 
int main()
{
    int m, i, j;
    while (scanf("%d", ⌖), target)
    {
        int depth;
        ans[1] = 1;
        if (target == 1)
        {
            puts("1");
            continue;
        }
        for (depth = 2; !DFS(2, depth); depth++);
        printf("%d", ans[1]);
        for (i = 2; i <= depth; i++) printf(" %d", ans[i]);
        puts("");
    }
    return 0;
}