#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<ll> d(n + 1, -1);
    d[1] = 1;
    queue<ll> q;
    q.push(1);
    while(!q.empty()) {
        ll v = q.front(); q.pop();
        ll cnt = __builtin_popcountll(v);
        rep(i, 2) {
            ll next = v + cnt * ((i == 0) ? -1 : 1);
            if ((next < 1) || (next > n) || (d[next] != -1)) continue;
            d[next] = d[v] + 1;
            q.push(next);
        }
    }
    cout << d[n] << endl;
    return 0;
}