#include #include int bit(int a); int main(void) { int N; int s = 1; // step int c = 0; // check scanf("%d", &N); int math[10001] = {0}; math[1] = 1; for (; ; s++) { c = 0; for (int i = 1; i <= N; i++) { if (math[i] == s) { int d = bit(i); // distance if (i+d == N) { printf("%d\n", s+1); exit(EXIT_SUCCESS); } if (i+d < N && !math[i+d]) { math[i+d] = s+1; c = 1; } if (0 < i-d && !math[i-d]) { math[i-d] = s+1; c = 1; } } } if (!c) { printf("-1\n"); exit(EXIT_SUCCESS); } } return EXIT_SUCCESS; } int bit(int a) { int t = 0; for (; a;) { if (a % 2) {t++;}; a /= 2; } return t; }