#include <iostream>
using namespace std;

int goal(int m, const int n, const int grid[], int count[]) {
  if (m == 1) return count[1];
  else {
    int c = -1;
    for (int i = 1; i <= n; i++) {
      if ((i + grid[i] == m || i - grid[i] == m) && count[i] >= 0) {
        if (count[i] == 0) c = goal(i, n, grid, count) + 1;
        else if (count[i] > 0) c = count[i] + 1;
        if (c > 0 && (count[m] <= 0 || count[m] > c)) count[m] = c;
      }
    }
    if (count[m] == 0) count[m]--;
    return count[m];
  }
}

int main(int argc, char** argv) {
  int n;
  cin >> n;
  int grid[n+1], count[n+1];
  for (int i = 0; i <= n; i++) {
    int num = i, one = 0;
    while (num > 0) {
      if (num % 2 == 1) one++;  num /= 2;
    }
    grid[i] = one;
  }
  count[0] = 0; count[1] = 1;
  for (int i = 2; i <= n; i++) {
    count[i] = 0;
  }
  int ans = -1;
  ans = goal(n, n, grid, count);
  cout << ans << endl;
  return 0;
}