#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#define aLL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXISt(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define MAX 100000000
#define pb push_back
using namespace std; 
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;
int dx[] = {0,1,0,-1};
int dy[] = {-1,0,1,0};

int sttoi(std::string str){int ret;std::stringstream ss;ss << str;ss >> ret;return ret;}
int n;
int mini = 10000000;
bool field[10001];

void move(int pos,int step){
  if(field[pos])return;
  if(pos == n){
    mini = min(mini,step);
    return;
  }
  field[pos] = true;
  int count = 0;
  int num = pos;
  while(num > 0){
    if(num % 2 == 1){
      count++;
    }
    num /= 2;
  }
  if(pos+count < n+1)move(pos+count,step+1);
  if(pos-count >= 1)move(pos-count,step+1);
}

int main(){
  cin >> n;
  move(1,1);
  if(mini != 10000000){
    cout << mini << endl;
  }else{
    cout << -1 << endl;
  }
}