#include <bits/stdc++.h>
using namespace std;
#define REP(i,N) for(i=0;i<N;i++)
typedef long long ll;
typedef pair<int, int> P;
typedef struct{
  int first;
  int second;
  int third;
}T;

//昇順
bool comp_Se(T& l, T& r){
  return l.second < r.second;
}
#define INF 1e9
int N;
vector<int> d;

int numofbits(int bits){
  bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
  bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
  bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
  bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
  return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}

int bfs(){
  set<int> s;
  queue<int> que;
  que.push(1);
  d[1] = 1;
  while(que.size()){
    int i = que.front();
    que.pop();
    if(i == N) break;
    int b = numofbits(i);
    if(i-b > 1 && d[i-b] == -1){
      d[i-b] = d[i]+1;
      que.push(i-b);
    }
    if(i+b <= N && d[i+b] == -1){
      d[i+b] = d[i]+1;
      que.push(i+b);
    }
  }
  return d[N];
}

int main(void){
  cin >> N;
  d = vector<int>(N+1,-1);
  cout << bfs() << endl;
  return 0;
}