#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int main()
{
    int n;
    cin>>n;
    queue<pair<int,int> > qu;
    qu.push(MP(1,0));
    VI f(n+1);
    while(!qu.empty()){
        int now = qu.front().first;
        int step = qu.front().second;
        qu.pop();
        int d = __builtin_popcount(now);
        if(f[now]++) continue;
        if(now == n){
            cout<<step+1<<endl;
            return 0;
        }
        if(now - d >= 1) qu.push(MP(now - d, step+1));
        if(now + d <= n) qu.push(MP(now + d, step+1));
    }
    cout<<-1<<endl;
    return 0;
}