#include <bits/stdc++.h>
using namespace std;

//--------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define LL long long
#define INF INT_MAX/3

//--------------------------------------------
const double EPS = 1e-14;
const double PI  = acos(-1.0);

//--------------------------------------------

int n;
int field[10000];
int d[2];
queue <int> q;

int cal (int m) {
  int b = 0;
  while (m) {
    b += m % 2;
    m = m / 2;
  }
  return b;
}

int bfs() {
  FOR (i, 1, n + 1) field[i] = INF;
  q.push(1);
  field[1] = 1;

  while (q.size()) {
    if (q.front() == n) break;

    d[0] = q.front() + cal(q.front());
    d[1] = q.front() - cal(q.front());

    REP (i,2) {
      if (0 < d[i] && d[i] <= n && field[d[i]] == INF) {
        q.push(d[i]);
        field[d[i]] = field[q.front()] + 1;
      }
    }
    q.pop();
  }
  return field[n];
}

int main(){
  scanf("%d",&n);
  int ans = bfs();
  if (ans == INF) ans = -1;
  printf("%d\n",ans);

}