#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

const int INF = 1e9;
int d[10010];
vector<int> G[10010];

int main(void) {
  int n;
  cin >> n;

  for (int i = 1; i < n; i++) {
    int cnt = __builtin_popcount(i);
    if (i - cnt >= 1) G[i].push_back(i - cnt);
    if (i + cnt <= n) G[i].push_back(i + cnt);
  }

  queue<pii> que;
  fill(d, d + n + 1, INF);
  d[1] = 1;
  que.push(pii(1, 1));
  while (!que.empty()) {
    pii p = que.front(); que.pop();
    int v = p.second;
    if (d[v] < p.first) continue;
    for (int i = 0; i < G[v].size(); i++) {
      int w = G[v][i];
      if (d[w] <= d[v] + 1) continue;
      d[w] = d[v] + 1;
      que.push(pii(d[w], w));
    }
  }
  cout << (d[n] == INF ? -1 : d[n]) << endl;
  
  return 0;
}