#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;

int GO(int x) {
    int res = 0;
    while (x) {
        res += x % 2;
        x /= 2;
    }
    return res;
}

int main() {
    int N;
    cin >> N;
    vector<int> ans(N + 1, -1);
    ans[1] = 1;
    queue<int> q;
    q.push(1);
    while (!q.empty()) {
        int n = q.front();
        q.pop();
        if (ans[n + GO(n)] == -1) {
            ans[n + GO(n)] = ans[n] + 1;
            q.push(n + GO(n));
        }
        if (ans[n - GO(n)] == -1) {
            ans[n - GO(n)] = ans[n] + 1;
            q.push(n - GO(n));
        }
    }
    cout << ans[N] << endl;
}