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

typedef pair<int,int> P;
int d[123456];
int f(int a){
  int res=0;
  while(a){res+=a&1;a>>=1;}
  return res;
}

int main(){
  int n;cin>>n;
  for(int i=2;i<123456;i++)d[i]=1e9;d[1]=1;
  priority_queue<P,vector<P>,greater<P>> que;
  que.push(P(1,1));
  while(que.size()){
    P p=que.top();que.pop();
    int A=p.first,B=p.second;
    int bi=f(B);
    if(A-bi>0){
      if(d[B-bi]>d[B]+1){
        d[B-bi]=d[B]+1;
        que.push(P(d[B-bi],B-bi));
      }
    }
    if(B+bi<=n){
      if(d[B+bi]>d[B]+1){
        d[B+bi]=d[B]+1;
        que.push(P(d[B+bi],B+bi));
      }
    }
  }
  if(d[n]>1e8)cout<<-1<<endl;
  else cout<<d[n]<<endl;
}