#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <climits>
#include <numeric>
#include <cmath>
#include <queue>
#include <sstream>
#include <string.h>
#include <bitset>

using namespace std;
typedef long long ll;

int main()
{
  int n;
  cin >> n;
  
  vector<bool> load(n, false);
  queue<pair<int, int>> q;
  q.push({1, 1});
  load[1] = true;
  
  
  while(!q.empty()) {
    pair<int, int> v = q.front();
    q.pop();
    
    if (n == v.first) {
      cout << v.second << endl;
      return 0;
    }
    
    bitset<20> bs(v.first);
    int next_plus = v.first + (int)bs.count();
    if (!load[next_plus] && 1 < next_plus && next_plus <= n) {
      q.push({next_plus, v.second + 1});
      load[next_plus] = true;
    }
    int next_minus = v.first - (int)bs.count();
    if (!load[next_minus] && 1 < next_minus && next_minus <= n) {
      q.push({next_minus, v.second + 1});
      load[next_minus] = true;
    }
  }
  cout << -1 << endl;
  return 0;
}