#include #include 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 template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template 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; } setst; rep(i, 60) { if (!(1 & (n >> i))) continue; if (st.count(1LL << i))st.erase(1LL << i); else st.insert(1LL << i); if (0 != i) { if (st.count(1LL << (i - 1)))st.erase(1LL << (i - 1)); else st.insert(1LL << (i - 1)); } } cout << st.size() << endl; for (auto e : st)cout << e << " "; return 0; }