#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    int N;
    cin >> N;
    const int inf = 1e8;
    vector<int> d(N + 1, inf);
	queue<int> que;
    que.push(1);
    d[1] = 1;

    while (!que.empty()) {
        int now = que.front(); que.pop();
        if (now == N)
             break;

        int w = __builtin_popcount(now);
        for (int nxt = now - w; nxt <= now + w; nxt += 2 * w) {
            if (nxt < 1 || nxt > N) continue;
            if (d[nxt] == inf) {
                que.push(nxt);
                d[nxt] = d[now] + 1;
            }
        }
    }

    cout << (d[N] == inf ? -1 : d[N]) << endl;

}