#include <iostream>
#include <vector>
#include <queue>

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> dist(n, -1);
    dist[0] = 1;
    std::queue<int> que;
    que.push(0);

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

        int d = __builtin_popcount(v + 1);

        for (int i = -1; i <= 1; ++i) {
            int nv = v + d * i;
            if (nv < 0 || n <= nv ||
                dist[nv] != -1) continue;

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

    std::cout << dist.back() << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}