#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <set>
#include <bitset>
#include <deque>
#include <complex>
#include <functional>
#include <utility>
#include <iterator>

#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000

#ifdef LOCAL
  #define eprintf(...) fprintf(stdout, __VA_ARGS__)
#else
  #define eprintf(...) 0
#endif

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned int uint;

int popcount(int n) {
  bitset<sizeof(int) * 8> b(n); 
  return b.count();
}

int main() {
  int n;
  cin >> n;
  vector<bool> visited(n+1, false);
  deque<int> q;
  q.push_back(1);

  bool cangoal = false;
  vector<int> counts(n + 1, INF);
  counts[1] = 1;
  if(n == 1) {
    cangoal = true;
    q.clear();
  }
  while(!q.empty()) {
    int cur = q.front();
    q.pop_front();
    int pc = popcount(cur);
    eprintf("cur:%d count:%d pc:%d\n", cur, counts[cur], pc);
    if(cur + pc == n) {
      eprintf("found! cur:%d goto:%d\n", cur, cur+pc);
      cangoal = true;
      counts[cur + pc] = counts[cur] + 1;
      break;
    }
    int back = cur - pc;
    int forward = cur + pc;
    eprintf("back:%d forward:%d n:%d\n", back, forward, n);
    if(back >= 1 && !visited[back]) {
      eprintf("cur:%d goto:%d\n", cur, back);
      q.push_back(back);
      visited[back] = true;
      counts[back] = counts[cur] + 1;
    }
    if(forward <= n && !visited[forward]) {
      eprintf("cur:%d goto:%d\n", cur, forward);
      q.push_back(forward);
      visited[forward] = true;
      counts[forward] = counts[cur] + 1;
    }
  }

  if(cangoal) {
    cout << counts[n] << endl;
  }
  else {
    cout << -1 << endl;
  }
  return 0;
}