import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable K = 20;

long N;

void main() {
  auto dp = new Tuple!(int, int)[][](K, 1 << K);
  foreach (top; 0 .. K) {
    foreach_reverse (x; 0 .. 1 << K) {
      const y = x + top + popcnt(x);
      dp[top][x] = (y < (1 << K)) ? dp[top][y] : tuple(0, y - (1 << K));
      ++dp[top][x][0];
    }
  }
  
  try {
    for (; ; ) {
      N = readLong();
      long ans = 1;
      long p = 0, q = 1;
      for (; ; ) {
        const t = dp[popcnt(p)][cast(int)(q)];
        if (((p + 1) << K | t[1]) > N) {
          break;
        }
        ans += t[0];
        ++p;
        q = t[1];
      }
      long n = p << K | q;
      for (; n < N; ) {
        ++ans;
        n += popcnt(n);
      }
      writeln((n == N) ? ans : -1);
    }
  } catch (EOFException e) {
  }
}