#include<iostream>
#include<queue>
using namespace std;
const int INF = 10000000;
int bitCount(int a){
	int count = 0;
	while(a > 0){
		if(a%2 != 0) count++;
		a = a/2;
	}
	return count;
}

int main(){
	int n;
	cin >> n;
	vector<int> road(n+1, INF);
	road[1] = 1;

	queue<int> q;
	q.push(1);
	while(!q.empty()){
		int now = q.front(); q.pop();
		int mv = bitCount(now);
		//mainasu ni susumu case
		if(now - mv > 0){
			if(road[now-mv] == INF) {
				//n kaisou
				road[now-mv] = road[now] + 1;
				q.push(now-mv);
			}
		}
		//purasu ni susumu case
		if(now + mv <= n){
			if(road[now+mv] == INF){
				road[now+mv] = road[now] + 1;
				q.push(now+mv);
			}
		}
	}
	if(road[n] == INF) cout << "-1" << endl;
	else cout << road[n] << endl;

}