#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

const int INF = 1e9;

int main(){
  int n;
  cin >> n;
  vector<int> dist(n+1,INF);
  dist[1] = 1;
  queue<int> que;
  que.push(1);

  while (!que.empty()){
    int now = que.front(); que.pop();
    int bit = __builtin_popcount(now);

    rep(i,2) {
      int d = (i ? now + bit : now - bit);
      if (d < 1 || d > n || dist[d] != INF) continue;
      dist[d] = dist[now] + 1;
      que.push(d);
    }
  }
  if (dist[n] == INF) cout << -1 << endl;
  else cout << dist[n] << endl;
  return 0;
}