#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
using namespace std;

int main(){
	//始まりの数値は１
	const int Max = 10000;
	int go[Max] = {0};
	int min[Max];
	int n;
	int least;
	
	cin >> n;
	
	//移動可能数算出
	for(int i=0; i<n; i++){
		least = i + 1;
		while(least > 0){
			if(least % 2 == 1){
				go[i] ++;
			}
			least /= 2;
		}
	}
	
	//min表初期化
	for(int i=0; i<n; i++){
		min[i] = 99999;
	}
	
	//移動最低数算出
	min[0] = 1;
	bool flg = false;
	int count = 0;	//スタックデータ数
	int stac[Max];
	int from = 0;
	
	//
	while(!flg){
		//現在地がゴールなら終了...ではない！！
		if(from == n - 1){
			//break;
		}
		
		//先へ移動
		if(from + go[from] <= n - 1){
			if(min[from] + 1 < min[ from + go[from] ]){
				min[from + go[from]] = min[from] + 1;
				stac[count] = from + go[from];
				count ++;
			}
		}
		
		//前へ移動
		if(from - go[from] >= 0){
			if(min[from] + 1 < min[ from - go[from] ]){
				min[from - go[from]] = min[from] + 1;
				stac[count] = from - go[from];
				count ++;
			}
		}
		
		//スタック消化(スタックがなくなったら終了)
		if(count == 0){
			break;
		}else{
			count --;
			from = stac[count];
		}
	}
	
	//結果出力
	if(min[n-1] == 99999){
		cout << -1 << endl;
	}else{
		cout << min[n-1] << endl;
	}
	
	//全て出力
	/*
	cout << endl;
	for(int i=0; i<n; i++){
		cout << min[i] << endl;
	}
	*/
	
	return 0;
}