#include int bc(int a) { int c = 0; while(a) { c += a % 2; a /= 2; } return c; } int time[21][1 << 20]; int next[21][1 << 20]; int main(void) { long long int n; scanf("%lld", &n); int u = n >> 20, l = n % (1 << 20), i, j; for(i = 0; i <= 20; i++) { for(j = (1 << 20) - 1; 0 <= j; j--) { int k = j + i + bc(j); if( (1 << 20) <= k ) { time[i][j] = 1; next[i][j] = k % (1 << 20); } else { time[i][j] = time[i][k] + 1; next[i][j] = next[i][k]; } } } int up, lp = 1; long long int c = 1; for(up = 0; up < u; up++) { c += time[ bc(up) ][lp]; lp = next[ bc(up) ][lp]; } while(lp < l) { lp += bc(u) + bc(lp); c++; } printf("%lld\n", (lp == l) ? c : -1 ); return 0; }