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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        vector<int> dis(n + 1, -1);
        dis[1] = 1;
        queue<int> q{{1}};

        while (!q.empty()) {
            int u = q.front();
            q.pop();

            int cnt = __builtin_popcount(u);

            for (auto v : {u + cnt, u - cnt}) {
                if (0 <= v && v <= n && dis[v] == -1) {
                    dis[v] = dis[u] + 1;
                    q.push(v);
                }
            }
        }

        cout << dis[n] << '\n';
    };
    
    solve();
    
    return 0;
}