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

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    int N; cin >> N; vector<int> dis(N+1, -1);
    queue<int> Q; Q.emplace(1); dis[1] = 1;
    while(!Q.empty())
    {
        int x = Q.front(); Q.pop();
        if(x == N)
        {
            cout << dis[x] << endl;
            return 0;
        }
        int p = __builtin_popcount(x);
        for(int y: {x-p, x+p}) if(1 <= y && y <= N && dis[y] == -1)
        {
            dis[y] = dis[x] + 1; Q.push(y);
        }
    }
    cout << -1 << endl;
}