#include #include // #include template struct array { T v[LENGTH]; constexpr T& operator[](size_t l) { // accessor return v[l]; } constexpr T const& operator[](size_t l) const { // accessor (allow writing) return v[l]; } }; constexpr int bitCount(uint32_t x) { const uint32_t m1 = 0x55555555; const uint32_t m2 = 0x33333333; const uint32_t m4 = 0x0f0f0f0f; const uint32_t m8 = 0x00ff00ff; const uint32_t m16 = 0x0000ffff; const uint32_t m32 = 0xffffffff; x -= (x >> 1) & m1; x = (x & m2) + ((x >> 2) & m2); x = (x + (x >> 4)) & m4; x += x >> 8; x += x >> 16; return x & 0x7f; } template constexpr array gggg() { auto vv = array(); vv[0] = 1; vv[1] = 1; vv[2] = 1; return vv; } template constexpr array, LEN> init() { auto aa = array, LEN>(); auto buf = gggg(); int bufPos = 2; int max=0; aa[1][1]=1; for (uint32_t i = 0; i < LEN; i++) { aa[i][0] = bitCount(i); } for (int i = 1; i < LEN; i++) { if (i >= bufPos) { break; } int plusMinus[2] = {(buf[i] + static_cast(aa[buf[i]][0])), (buf[i] - static_cast(aa[buf[i]][0]))}; for (int v : plusMinus) { if ((v < 1 || LEN <= v) || aa[v][1] != 0) { continue; } else { aa[v][1] = aa[buf[i]][1] + 1; aa[v][2] = aa[buf[i]][2] > v ? aa[buf[i]][2] : v; buf[bufPos] = v; bufPos++; } } } return aa; } int main(int argc, char* argv[]) { constexpr auto ar = init(); int in; scanf("%d",&in); int ans = static_cast(ar[in][1]); if(ans < static_cast(ar[in][2])){ ans = -1; } printf("%d",ans); return 0; }