#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1);
const ll MOD = 1000000007;

int main() {
  int N; cin >> N;
  
  vector<int> dist(N+1,-1);
  dist[1] = 1;
  queue<int> que;
  que.push(1);
  
  while (!que.empty()) {
    int v = que.front();
    que.pop();
    
    bitset<20> s(v);
    
    int w = v + s.count();
    if (w  <= N && dist[w] == -1) {
      que.push(w);
      dist[w] = dist[v] + 1;
    }
    int u = v - s.count();
    if (u > 0 && dist[u] == -1) {
      que.push(u);
      dist[u] = dist[v] + 1;
    }
  }
  
  cout << dist[N] << endl;    
}