#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30; 
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    while(cin >> n)
    {
        vector<int> v;
        for(int i = 0; i < 10; i++)
        {
            if(n & (1<<i)) v.push_back(pow(2, i)); 
        }
        for(int i = 0; i < v.size(); i++)
        {
            if(i > 0) cout << " " << v[i];
            else cout << v[i];
        }
        cout << endl;
    }
    return 0;
}


