/* -*- coding: utf-8 -*-
 *
 * 3.cc: No.3 ビットすごろく - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 10000;
const int INF = 1 << 30;

/* typedef */

typedef queue<int> qi;

/* global variables */

int bns[MAX_N + 1], dists[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  for (int bits = 1; bits <= n; bits++) {
    bns[bits] = 0;
    for (int bi = 1; bi <= n; bi <<= 1)
      if (bits & bi) bns[bits]++;
  }

  for (int i = 0; i <= n; i++) dists[i] = INF;
  dists[1] = 1;

  qi q;
  q.push(1);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    if (u == n) break;

    int vd = dists[u] + 1;
    int ub = bns[u];

    int v = u + ub;
    if (v <= n && dists[v] > vd) {
      dists[v] = vd;
      q.push(v);
    }

    v = u - ub;
    if (v >= 1 && dists[v] > vd) {
      dists[v] = vd;
      q.push(v);
    }
  }

  printf("%d\n", (dists[n] < INF) ? dists[n] : -1);
  return 0;
}