#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

const int INF = 1e9;

int d[16384];

int bitc(int n) {
  int res = 0;
  while (n > 0) {
    res += n % 2;
    n /= 2;
  }
  return res;
}

int main() {
  int n; cin >> n;
  REP(i,16384) d[i] = INF;
  d[1] = 1;
  queue<int> que;
  que.push(1);
  while (!que.empty()) {
    int v = que.front(); que.pop();
    int dv = bitc(v);
    if (v - dv >= 1 && d[v - dv] == INF) {
      d[v - dv] = d[v] + 1;
      que.push(v - dv);
    }
    if (v + dv <= n && d[v + dv] == INF) {
      d[v + dv] = d[v] + 1;
      que.push(v + dv);
    }
  }
  cout << (d[n] == INF ? -1 : d[n]) << endl;
  return 0;
}