#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline ll time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n; cin >> n;
    if(n == 0){
        cout << -1 << endl;
        return 0;
    }
    vector<ll> v;
    int idx;
    for(int i=0;i<60;i++){
        if((1LL<<i)&n){
            idx = i;
        }
    }
    for(int j=idx;j>=0;j--){
        if((1LL<<j)&n){
            v.push_back((1LL<<(j)));
            while(j >= 0 and ((1LL<<j)&n)){
                j--;
            }
            if(j >= 0){
                v.push_back((1LL<<(j)));
            }
        }
    }
    cout << v.size() << endl;
    for(ll i:v){
        cout << i << " ";
    }
    cout << endl;
}