AC!!!!!!!!!!!!!!!!!!!!!!!!!

#include <bits/stdc++.h>
using namespace std;
int find(int k)
{
    for (int i = 1;i <= k;i++)
    {
        if (pow(2,i) > k) return pow(2,i - 1);
    }
}
int main()
{
    int m,h;
    cin >> m;
    if (m % 2 == 0)
    {
        h = m;
        while (h > 1)
        {
            cout << find(h) << " ";
            h -= find(h);
        }
    }
    else
    {
        cout << "-1";
    }
}