#include <iostream>
#include <queue>
#include <utility>
using namespace std;

const int kINF = 1 << 28;
const int kMAX_N = 10010;

int N;
int one_count[kMAX_N];
int cost[kMAX_N];

void Solve() {
    fill(cost, cost + kMAX_N, kINF);
    for (int i = 1; i < N; i++) {
        int count = 0;
        for (int j = 0; j < 32; j++) {
            if ((i >> j) & 1) count++;
        }
        one_count[i] = count;
    }

    queue<int> que;
    cost[1] = 1;
    que.push(1);
    while (!que.empty()) {
        int mass = que.front(); que.pop();
        if (mass == N) {
            cout << cost[mass] << endl;
            return;
        }

        if (mass + one_count[mass] <= N &&
                cost[mass + one_count[mass]] > cost[mass] + 1) {
            cost[mass + one_count[mass]] = cost[mass] + 1;
            que.push(mass + one_count[mass]);
        }
        if (mass - one_count[mass] > 0 &&
                cost[mass - one_count[mass]] > cost[mass] + 1) {
            cost[mass - one_count[mass]] = cost[mass] + 1;
            que.push(mass - one_count[mass]);
        }
    }
    cout << -1 << endl;
}

int main() {
    cin >> N;

    Solve();
    return 0;
}