#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef vector<vector<int>> Graph;

int binbitnum(int n) {
    int cnt = 0;
    while (n) {
        if (n & 1) {
            ++cnt;
        }
        n = n >> 1;
    }
    return cnt;
}

vector<int> bfs(Graph &G, int s) {
    int N = (int)G.size();
    vector<int> dist(N, -1);

    queue<int> que;
    dist[s] = 1;
    que.push(s);

    while (!que.empty()) {
        int v = que.front();
        que.pop();

        for (auto x : G[v]) {
            if (dist[x] != -1) continue;

            dist[x] = dist[v] + 1;
            que.push(x);
        }
    }

    return dist;
}

int main() {
    int N;
    cin >> N;
    
    Graph G(N);
    for (int i = 0; i < N; ++i) {
        int dx = binbitnum(i + 1);
        if (i + dx < N) {
            G[i].push_back(i + dx);
        }
        if (i - dx >= 0) {
            G[i].push_back(i - dx);
        }
    }

    vector<int> dist = bfs(G, 0);

    cout << dist[N - 1] << endl;
}