//586.cpp
#include <vector>
#include <iostream>
#include <cstdio>
#define rep(i,n) for(int i=1;i<=N;i++)
using namespace std;
typedef unsigned long ul;
typedef pair<ul, ul> P;

int sugoroku[10001],N;
int flag[10001];
int gosu(int i,int s){
	if(i == N)return s;
	if(flag[i] > 0)if(flag[i] <= s) return 100001;
	flag[i] = s;

	int j,k;
	j = i - sugoroku[i];
	k = i + sugoroku[i];
	if(j > 0 && k <= N) return min(gosu(j,s+1),gosu(k,s+1));
	else if(j <= 0 && k <= N) return gosu(k,s+1);
	else if(j > 0 && k > N) return gosu(j,s+1);
	else	{
		return 100001;
	}
}

int main() {
	int i=1,ans;
	scanf("%d",&N);
	//すごろくのすすめるマス数決定
	rep(i,N){
		int decimal = i,base=1;
		sugoroku[i] = 0;
		flag[i] = -1;
		while(decimal > 0){
			sugoroku[i] += decimal%2;
			decimal /= 2;
		}
	}
	ans = gosu(1,1);
	if(ans > 0 && ans < 10000)printf("%d\n",ans);
	else	printf("-1\n");

	return 0;
}