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

#define fastcin {\
    cin.tie(0);\
    ios::sync_with_stdio(false);\
}
#define REP(i, a) for(int i = 0; i < a; i++)
#define scan(x) cin >> n;
#define print(x) cout << x << "\n"
#define INF 999999999

int countbit(int n) {
    int count = 0;
    for (int i = 1; i < n + 1; i <<= 1) if (n & i) count++;
    return count;
}

int main() {
    fastcin;
    int n;
    scan(n);

    int masu[10001];
    queue<int> q;
    REP(i, 10001) masu[i] = INF;

    int ans = -1;
    masu[1] = 1;
    q.push(1);

    int move, p ,m, v;
    if (n != 1) {
        while (q.size()) {

            v = q.front();
            q.pop();

            if (masu[v] != INF && masu[v] != -1) {

                move = countbit(v);
                p = v + move;
                m = v - move;
                if (p == n || m == n) {
                    print(masu[v] + 1);
                    exit(0);
                }

                if (p < n && masu[p] == INF) {
                    q.push(p);
                    masu[p] = masu[v] + 1;
                }
                if (m > 0 && masu[m] == INF) {
                    q.push(m);
                    masu[m] = masu[v] + 1;
                }

                masu[v] = -1;
            }
        }
    }
    else ans = 1;

    print(ans);
    return 0;
}