#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <bitset>

#define rep(i,n) for(i=0; i<n; ++i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
using namespace std;
using lint = long long;

int main(void){
    int i, j, n, m, k, cnt = 1;
    in(n);
    bitset<9999> masu(0);
    int cur = 0;
    
    while(cur>=0&&!masu[cur]){
        masu.set(cur);
        if(cur==n-1)    break;
        bitset<14> bit(cur+1);
        int forw = bit.count();
        if(n-1<cur+forw)    cur-=forw;
        else    cur+=forw;
        cnt++;
    }
    masu[n-1] ? out(cnt,endl) : out(-1,endl);
    return 0;
}