#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n; cin >> n;
	if (0 == n) {
		cout << -1 << endl;
		return 0;
	}
	map<long long, int>mp;
	rep(i, 60) {
		if (!(1 & (n >> i))) continue;

		if (0 == i) {
			mp[1LL << i]++;
		}
		else {
			mp[1LL << i]++;
			mp[1LL << (i - 1)]++;
		}
	}
	vector<long long>ans;
	for (auto[k, v] : mp) {
		if (1 == v % 2)ans.push_back(k);
	}
	cout << ans.size() << endl;
	rep(i, ans.size()) cout << ans[i] << " ";
	return 0;
}