#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
std::vector<T> divisor(const T n) {
  std::vector<T> res;
  T i = 1;
  for (; i * i < n; ++i) {
    if (n % i == 0) {
      res.emplace_back(i);
      res.emplace_back(n / i);
    }
  }
  if (i * i == n && n % i == 0) res.emplace_back(i);
  std::sort(res.begin(), res.end());
  return res;
}

ll f(ll n) {
  ll res = 0;
  for (ll d : divisor(n)) res += d;
  return res;
}

int main() {
  constexpr int B = 40;
  ll n; cin >> n;
  if (n == 0) {
    cout << "-1\n";
    return 0;
  }
  vector<ll> a;
  for (int b = B - 1; b >= 0; --b) {
    if (!(n >> b & 1)) continue;
    ll lb = 0, ub = 1LL << (b + 1);
    while (ub - lb > 1) {
      const ll mid = (lb + ub) / 2;
      (f(mid) >= (1LL << b) ? ub : lb) = mid;
    }
    a.emplace_back(ub);
    n ^= f(ub);
  }
  assert(n == 0);
  const int m = a.size();
  cout << m << '\n';
  REP(i, m) cout << a[i] << " \n"[i + 1 == m];
  return 0;
}