#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int d[10005];
int visited[10005];

int main(){
  rep(t,10005){
    int res = 0;
    for(int i=31; i>=0; i--) if(t>>i&1) res++;
    d[t] = res;
  }

  int N;
  cin >> N;
  
  queue< pair<int,int> > que;
  que.push(make_pair(1,1));

  while(!que.empty()){
    pair<int,int> p = que.front(); que.pop();
    if(visited[p.first] == 1) continue;
    visited[p.first] = 1;
    
    if(p.first == N){
      cout << p.second << endl;
      return 0;
    }
    if(p.first - d[p.first] >= 1){
      que.push(make_pair(p.first-d[p.first], p.second+1));
    }
    if(p.first + d[p.first] <= N){
      que.push(make_pair(p.first+d[p.first], p.second+1));
    }
  }

  cout << -1 << endl;
  return 0;
}