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

#define MAX 9999999

int bitcount(int bits) {
    int num  = 0;
    for ( ; bits != 0 ; bits &= bits - 1 ) {
        num++;
    }
    return num;
}

int main() {
    int N;
    cin >> N;
    vector<int> dp(N+1, MAX);
    dp[1] = 1;
    queue<int> que;
    que.push(1);
    // BFS
    while(!que.empty()) {
        int state = que.front();
        que.pop();
        int move = bitcount(state);
        for(int i=-move; i<=move; i+=move*2) {
            int next = state + i;
            if(next < 1 || next > N) continue;
            if(dp[next] != MAX) continue;
            dp[next] = dp[state] + 1;
            que.push(next);
        }
    }

    if(dp[N] == MAX) {
        cout << -1 << endl;
    } else {
        cout << dp[N] << endl;
    }
}