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

using namespace std;

int main() {

  int n;
  const int inf = 1000000;

  cin >> n;

  vector<int> w(n+1,inf);

  queue<int> q;

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

  while (!q.empty()) {

    int bitcnt;

      u = q.front(); q.pop();

      bitcnt = __popcount(u);

      ub = u - bitcnt; uf = u + bitcnt;

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

      if (uf>0 && uf<=n && w[uf]==inf) {
        q.push(uf);
        w[uf] = w[u] + 1;
      }
  } 
  cout << (w[n] != inf ? w[n] : -1) << endl;

  return 0;
}