// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll d[11000];
ll n;
ll bc(ll v){
  ll res=0;
  while(v>0){
    if(v%2==1) res++;
    v>>=1;
  }
  return res;
}
signed main(){
  ll next,ad;
  fill(d,d+11000,INF);
  cin >> n;
  priority_queue<P,vector<P>,greater<P>> que;
  que.push(P(1,1));
  while(!que.empty()){
    P tmp = que.top(); 
    ll v=tmp.first,dis=tmp.second;
    que.pop();
    if(d[v]<=dis){
      continue;
    }
    d[v] = dis;
    ad = bc(v);
    dis++;

    next = v+ad;
    if(next<=n){
      que.push(P(next,dis));
    }
    
    next = v-ad;
    if(next>0){
      que.push(P(next,dis));
    }
  }
  if(d[n]==INF){
    d[n]=-1;
  }
  cout << d[n]<<endl;
}