#include <assert.h>
#include <ctype.h>
#include <float.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>

#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define SZ(a) (int)(a).size()
#define FOR(i,a,b) for (int i=(a); i<=(b); ++i)
#define REP(i,n) for (int i=0; i<(n); ++i)
#define ALL(c) c.begin(), c.end()
#define CLR(c,n) memset(c, n, sizeof(c))
#define MCPY(d, s) memcpy(d, s, sizeof(d))
#define TR(it, c) for (auto it = c.begin();it != c.end(); ++it)
#define CONTAIN(it, c) (c.find(it) != c.end())
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> void checkmin(T &a, T b) { if (b<a) a=b; }
template <class T> void checkmax(T &a, T b) { if (b>a) a=b; }
typedef long long LL;
const int INF=0x3F3F3F3F;

const int N=10<<10;
int steps[N], q[N], qa, qe;
int go(int n) {
  if (n == 1) return 1;
  CLR(steps, 0);
  qa = qe = 0;
  q[qe++] = 1;
  steps[1] = 1;
  while (qa < qe) {
    int s = q[qa++], b = __builtin_popcount(s);
    int t[2] = {s - b, s + b};
    REP(i, 2) {
      if (t[i] < 1 || t[i] > n || steps[t[i]]) continue;
      steps[t[i]] = steps[s] + 1;
      q[qe++] = t[i];
      if (t[i] == n) return steps[t[i]];
    }
  }
  return -1;
}

int main(int argc, char *argv[]) {
  int n;
  while (cin >> n) cout << go(n) << endl;
}