#include<bits/stdc++.h>
using namespace std;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

#define int long long
#define pb push_back
#define fi first
#define se second
//#define endl '\n'

typedef pair<int,int> pii;

const int K = 20;

int qb(int x) { return __builtin_popcountll(x); };

pii dp[K+1][1LL<<K];

int32_t main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    for(int k = 0;k <= K;k++)
    {
        for(int i = (1LL<<K)-1;i >= 0;i--)
        {
            if(i+(k+qb(i))<(1LL<<K)) dp[k][i] = dp[k][i+(k+qb(i))];
            dp[k][i].fi += k+qb(i), dp[k][i].se++;
        }
    }

    int n;
    cin >> n;
    pii cur = {1, 1};
    while(cur.fi>>K!=n>>K)
    {
        int i = qb(cur.fi>>K), j = (cur.fi%(1LL<<K));
        cur.fi += dp[i][j].fi, cur.se += dp[i][j].se;
    }
    while(cur.fi<n) cur.fi += qb(cur.fi), cur.se++;
    cout << (cur.fi==n ? cur.se : -1) << endl;

    return 0;
}