#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;

int main() {
    int n;
    cin >> n;
    vi dp(n + 1, 1e9);
    dp[1] = 0;
    queue<int> que;
    que.push(1);
    while (que.size()) {
        int t = que.front();
        que.pop();

        int p = __builtin_popcount(t);
        int dx[] = {-1, 1};
        for (int i = 0; i < 2; i++) {
            int k = t + dx[i] * p;
            if (1 <= k && k <= n && dp[t] + 1 < dp[k]) {
                dp[k] = dp[t] + 1;
                que.push(k);
            }
        }
    }

    cout << (dp[n] == 1e9 ? -1 : dp[n] + 1) << endl;
}