#include using namespace std; using VS = vector; using LL = long long; using VI = vector; using VVI = vector; using PII = pair; using PLL = pair; using VL = vector; using VVL = vector; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define EB emplace_back #define MP make_pair #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++) #define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--) #define debug(x) cerr << #x << ": " << x << endl const int INF = 1e9; const LL LINF = 1e16; const LL MOD = 1000000007; const double PI = acos(-1.0); int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 }; /* ----- 2018/08/31 Problem: yukicoder262 / Link: __CONTEST_URL__ ----- */ /* ------問題------ -----問題ここまで----- */ /* -----解説等----- ----解説ここまで---- */ int main() { cin.tie(0); ios_base::sync_with_stdio(false); LL N; cin >> N; VVL cntMemo(30, VL(41, 0)); VVL addValue = cntMemo; const LL sqrtDecompValue = 1 << 20; #define b(x) __builtin_popcountll(x) FOR(i, 0,21) { FOR(j, 0, 41) { if (!i && !j)continue; LL curValue = j; int steps = 0; while (curValue < sqrtDecompValue) { curValue += b(curValue) + i; steps++; } cntMemo[i][j] = steps; addValue[i][j] = curValue - j; } } LL ans = 1; LL curValue = 1; // skip simulation while (curValue + addValue[b(curValue>>20)][curValue&63]< N) { ans+=cntMemo[b(curValue >> 20)][curValue & 63]; curValue+= addValue[b(curValue >> 20)][curValue & 63]; } while (curValue < N) { ans++; curValue += b(curValue); } if (curValue != N)ans = -1; cout << ans << "\n"; return 0; }