// unsolved
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;

int main() {
  int n;
  cin >> n;
  vector<ll> dp(n + 1, INF);
  dp[0] = 0;
  dp[1] = 1;
  queue<int> q;
  q.push(1);
  while (!q.empty()) {
    int now = q.front();
    q.pop();
    bitset<30> b = now;
    int step = b.count();
    if (now - step > 0) {
      if (dp[now] + 1 < dp[now - step]) {
        dp[now - step] = dp[now] + 1;
        q.push(now - step);
      }
    }
    if (now + step <= n) {
      if (dp[now] + 1 < dp[now + step]) {
        dp[now + step] = dp[now] + 1;
        q.push(now + step);
      }
    }
  }
  if (dp[n] == INF) dp[n] = -1;
  cout << dp[n] << endl;
}