#include <bits/stdc++.h>

using namespace std;

int N;
int dist[10101];
vector<vector<int>> G;

int func(int x) {
  int ret = 0;
  while (x != 0) {
    ret += x % 2;
    x /= 2;
  }

  return ret;
}

int main() {
  cin >> N;
  G.assign(N + 1, vector<int>());
  for (int i = 1; i <= N; i++) {
    int to = func(i);
    if (0 < i - to) G[i].push_back(i - to);
    if (i + to <= N) G[i].push_back(i + to);
  }

  for (int i = 2; i <= N; i++) dist[i] = 1e9;
  queue<int> que;
  que.push(1);
  while (!que.empty()) {
    int q = que.front();
    que.pop();
    for (auto to : G[q]) {
      if (dist[q] + 1 < dist[to]) {
        dist[to] = dist[q] + 1;
        que.push(to);
      }
    }
  }

  if (1e9 <= dist[N]) {
    cout << -1 << endl;
  } else {
    cout << dist[N] + 1 << endl;
  }

  return 0;
}