#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <stack>
#include <vector>
#include <random>
#include <queue>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(int I = int(A); I < int(B); ++I)


int main(){
    int N;
    cin >> N;
    queue<int> q,d;
    q.push(1);
    d.push(1);
    vector<bool> did(N+1,false);
    did[1]=true;
    while(q.size()){
        int x = q.front();
        int y = d.front();
        q.pop();d.pop();
        if(x==N){
            cout << y << endl;
            return 0;
        }
        int cnt=0,z=x;
        while(z){
            cnt+=z&1;
            z/=2;
        }
        if(x-cnt>0 && !did[x-cnt]){
            q.push(x-cnt);
            d.push(y+1);
            did[x-cnt] = true;
        }
        if(x+cnt<=N && !did[x+cnt]){
            q.push(x+cnt);
            d.push(y+1);
            did[x+cnt] = true;
        }
    }
    cout << -1 << endl;
}