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

#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
 
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9+7;

Int dp[10001];

Int f(Int x) {
    Int ret = 0;
    while (x > 0) {
        ret += x % 2;
        x /= 2;
    }
    return ret;
}

int main() {
    Int n;
    cin >> n;
    for (Int i = 0; i <= n; i++) {
        dp[i] = INF;
    }
    dp[0] = dp[1]= 1;
    queue<Int> q;
    q.push(1);
    while (not q.empty()) {
        Int p = q.front();
        q.pop();
        Int d = f(p);
        if (1 <= p - d and dp[p] + 1 < dp[p - d]) {
            dp[p - d] = dp[p] + 1;
            q.push(p - d);
        }
        if (p + d <= n and dp[p] + 1 < dp[p + d]) {
            dp[p + d] = dp[p] + 1;
            q.push(p + d);
        }
    }
    dump(dp[n] == INF ? -1 : dp[n]);
    return 0;
}