#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N;
    cin >> N;
    vector<ll> ans; 

    if (N == 0){
        cout << -1 << endl;
        return 0;
    }

    for (int i=40; i>=0; i--){
        if ((N >> i) % 2 != ans.size() % 2) ans.push_back((1LL<<i));
    }
    
    cout << ans.size() << endl;
    for (auto x : ans) cout << x << " ";
    cout << endl;

    return 0;
}