#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n;
  cin >> n;
  queue<int> que;
  vector<int> dist(10001, -1);
  dist[1] = 1;
  que.push(1);
  while (!que.empty()) {
    int v = que.front();
    que.pop();
    int cnt = __builtin_popcount(v);
    if (0 < v - cnt && dist[v - cnt] == -1) {
      dist[v - cnt] = dist[v] + 1;
      que.push(v - cnt);
    }
    if (v + cnt <= n && dist[v + cnt] == -1) {
      dist[v + cnt] = dist[v] + 1;
      que.push(v + cnt);
    }
  }
  cout << dist[n] << endl;
  return 0;
}