#include #include #include int bit_count(int a) { int i = 0; while(a) { i++; a &= (a-1); } return i; } int search(int *a, int n) { int b[10001], i, j, cnt = 0; memcpy(b, a, n*4+4); for( i = 0; i <= n; i++) { if(b[i]) { int t = bit_count(i); if(!b[i+t] || b[i+t] > b[i]+1) { b[i+t] = b[i]+1; cnt++; } if(i-t > 0){ if(!b[i-t] || b[i-t] > b[i]+1) { b[i-t] = b[i]+1; cnt++; } } } } memcpy(a, b, n*4+4); return cnt; } int main(void) { int n, i, a[10001] = {0, 1}; scanf("%d", &n); while(i = search(a, n)); if(!a[n]) { printf("-1\n"); } else { printf("%d\n", a[n]); } return 0; }