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

typedef pair<int,int> P;
typedef long long ll;

#define rep(i,n) for(int i=0;i<n;i++)
#define pb push_back
#define inf INT_MAX/4
#define ALL(v) v.begin(),v.end()

struct State{
  int pos;
  int cost;
};

int main(void){
  int N;
  bool visit[10005];
  memset(visit, false, sizeof(visit));
  bool isClear = false;
  queue<State> q;

  cin >> N;
  q.push((State){1,1});


  while(!q.empty()){
    State now = q.front();q.pop();
    if(now.pos == N){
      isClear = true;
      cout << now.cost << endl;
      break;
    }

    int front = now.pos + __builtin_popcount(now.pos);
    if(front < N+1 && !visit[front]){
      visit[front] = true;
      q.push((State){front,now.cost+1});
    }

    int back = now.pos - __builtin_popcount(now.pos);
    if(0 < back && !visit[back]){
      visit[back] = true;
      q.push((State){back,now.cost+1});
    }
  }

  if(!isClear) cout << -1 << endl;

  return 0;
}