#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    long long n;
    cin >> n;

    long long a = 1;
    long long cnt = 1;
    map<pair<int, int>, pair<long long, int> > memo;
    while(a < n){
        int high = bitset<32>(a >> 20).count();
        int low = a & ((1 << 20) - 1);

        if(memo.find(make_pair(high, low)) != memo.end()){
            long long b = a + memo[make_pair(high, low)].first;
            if(b <= n){
                a = b;
                cnt += memo[make_pair(high, low)].second;
                continue;
            }
        }

        long long b = a;
        int add = 0;
        while(b < n && (a >> 20) == (b >> 20)){
            ++ add;
            b += high + bitset<32>(b & ((1 << 20) - 1)).count();
        }
        memo[make_pair(high, low)] = make_pair(b - a, add);
        a = b;
    }

    if(a == n)
        cout << cnt << endl;
    else
        cout << -1 << endl;

    return 0;
}