#include <algorithm>
#include <bitset>
#include <iostream>
#include <queue>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
using namespace std;

int dist(int x, int y) { return (x > y) ? (x - y) : (y - x); }

int count(int n) {
  int cnt = 0;
  stringstream ss;
  ss << static_cast<bitset<16> >(n);
  string s = ss.str();
  for (auto itr = s.begin(); itr != s.end(); itr++) {
    if (*itr == '1') cnt++;
  }
  return cnt;
}

bool in(vector<int> v, int n) {
  for (auto& var : v) {
    if (var == n) return true;
  }
  return false;
}

int solve(int n) {
  queue<pair<int, int> > q;  // <位置, 歩数>
  q.push(make_pair(1, 1));
  vector<int> v;
  v.push_back(1);  // 行ったことがある数字を覚えておく
  while (!q.empty()) {
    pair<int, int> tmp = q.front();
    int num = tmp.first;
    int cnt = tmp.second;
    q.pop();
    if (num == n) return cnt;
    int forward = num + count(num);
    int backward = num - count(num);
    if (!(in(v, forward)) && (forward <= n)) {
      q.push(make_pair(forward, cnt + 1));
      v.push_back(forward);
    }
    if (!(in(v, backward)) && (backward > 0)) {
      q.push(make_pair(backward, cnt + 1));
      v.push_back(backward);
    }
  }
  return -1;
}

int main() {
  int n;
  cin >> n;
  cout << solve(n) << endl;
  return 0;
}