#include "bits/stdc++.h"

using namespace std;

#define ll long long
#define vi  vector<int>
#define vvi vector<vi>
#define pi  pair<int,int>
#define mp  make_pair
#define pb  push_back
#define MOD 1e9 + 7
#define PAI  3.1415
#define all(x) (x).begin(),(x).end()
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
#define pr(x) cout << x << endl
#define Endl endl
#define rep(i,n) for(int i = 0 ; i < n; i++)

const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
const int ddx[8] = {-1,0,1,-1,1,-1,0,1};
const int ddy[8] = {-1,-1,-1,0,0,1,1,1};
const int inf = 99999999;
const ll linf = 1LL << 62;

ll gcd(ll a,ll b){
  if(a < b)swap(a , b);
  if(a % b == 0) return b;
  else gcd(b, a%b);
}

ll lcm(ll a,ll b){
  if(a < b)swap(a , b);
  return (a/gcd(a , b)) * b;
}


vi mass(100010, 0);

int bitnum(int a){
  int b = a%2;
  while(a /= 2) b += a%2;
  return b;
}

int main(){

  int n; cin >> n;
  mass[1] = 1;
  queue<int> q;
  q.push(1);

  while(!q.empty()){
    int pos = q.front(); q.pop();
    int move = bitnum(pos);

    if(pos - move > 1 and mass[pos - move] == 0 and pos - move <= n){
      mass[pos - move] = mass[pos] + 1;
      q.push(pos - move);
    }
    if(pos + move > 1 and mass[pos + move] == 0 and pos + move <= n){
      mass[pos + move] = mass[pos] + 1;
      q.push(pos + move);
    }
  }

  if(mass[n] != 0)
    pr(mass[n]);
  else
    pr("-1");

  return 0;
}