#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long Linf = 1e18 + 5;
template <class T>
inline void umax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <class T>
inline T lcm(T a, T b) {
  return a / __gcd(a, b) * b;
}
inline int read() {
  int res = 0;
  int neg;
  while (true) {
    char ch = getchar();
    if (ch >= '0' && ch <= '9' || ch == '-') {
      if (ch == '-')
        neg = -1;
      else
        neg = 1, res = ch - '0';
      break;
    }
  }
  while (true) {
    char ch = getchar();
    if (ch >= '0' && ch <= '9')
      res *= 10, res += ch - '0';
    else
      break;
  }
  return res * neg;
}
vector<long long> v;
int main() {
  long long n;
  cin >> n;
  for (int(k) = (0); (k) <= (62); (k)++) {
    long long x = 0LL;
    for (int(i) = (0); (i) <= (k - 1); (i)++) x += (1LL << (i));
    long long l = 0, r = n + n;
    while (l + 1 < r) {
      long double m = (l + r) >> 1;
      if (m * (m - 1) / 2LL + m * x <= n)
        l = m;
      else
        r = m;
    }
    long long a = l;
    if (a * (a - 1) / 2LL + a * x == n && a % 2 == 1)
      v.push_back(a * (1LL << (k)));
  }
  if (v.size() == 0) {
    cout << -1 << endl;
    return 0;
  }
  sort(v.begin(), v.end());
  for (int(i) = (0); (i) < (v.size()); (i)++) {
    cout << v[i] << endl;
  }
  return 0;
}
