#include <iostream>
#include <bitset>
#include <vector>
#include <queue>
#include <utility>

using namespace std;

int main() {

  int n;
  int t;
  
  cin >> n;

  vector<int> w(n+1,0);
  vector<bool> v(n+1, false);

  queue<int> q;

  /*for (int i=1; i<=n; i++) {
      cout << __popcnt(i) << " ";
  }
cout << endl;*/

 int u, ub, uf;
  q.push(1);
  u = 1; w[1] = 1;

  while (!q.empty()) {

      u = q.front(); q.pop();
      v[u] = true;

      if (v[n]==true) {cout << w[n] << endl;return 0;}

      ub = u - __popcount(u); uf = u + __popcount(u);

      if (ub>0 && v[ub]==false) {
        q.push(ub);
        w[ub] = w[u] +1; 
      }

      if (uf<=n && v[uf]==false) {
        q.push(uf);
        w[uf] = w[u] +1;
      }
  } 
  cout << -1 << endl;

  return 0;
}