#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

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

  //   vector<int> dist(n + 1, -1);11
  //   auto dfs = [&](auto &f, int x, int d) -> void {
  //     if (x < 1 || x > n || dist[x] != -1) return;
  //     dist[x] = d;
  //     int bit = __builtin_popcount(x);
  //     f(f, x + bit, d + 1);
  //     f(f, x - bit, d + 1);
  //   };
  //   dfs(dfs, 1, 1);

  queue<int> q;
  vector<int> dist(n + 1, -1);
  auto push = [&](int nx, int nd) {
    if (nx < 1 || nx > n || dist[nx] != -1) return;
    dist[nx] = nd;
    q.push(nx);
  };
  push(1, 1);

  while (sz(q)) {
    int x = q.front();
    q.pop();

    int bit = __builtin_popcount(x);
    push(x - bit, dist[x] + 1);
    push(x + bit, dist[x] + 1);
  }

  int ans = dist[n];
  cout << ans << endl;
  return 0;
}