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

const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<'\n'


int main(){
    int n;
    cin >> n; 
    queue<int> q;
    vector<int> vec(n+10,INF);//最小値を今回は求めるためINFで初期化
    int now = 1;
    q.push(1);vec[1]=1;
    //最小経路を求めたいので幅優先選択を行う
    while(!q.empty()){//すべての転移がおわるまで
        now = q.front();q.pop();
        int bit = __builtin_popcount(now);
        if(now-bit>0&&vec[now-bit]==INF){
            vec[now-bit] = vec[now] + 1;
            q.push(now-bit);
        }
        if(now+bit<=n&&vec[now+bit]==INF){
            vec[now+bit] = vec[now] + 1;
            q.push(now+bit);
        }
    }
    cout<<(vec[n]<INF ? vec[n]:-1) << endl;
    return 0;
}