#include <iostream>
#include <queue>
using namespace std;

int  main(void){
	queue<int> q;
	int N,check,count = 0,v,inc;
	cin >> N;
	bool memo[N+1];
	q.push(1);
	while(!q.empty()){
		check = q.front(); q.pop();
		memo[check] = true;
		if(check == N){
			cout << ++count << endl;
			return 0;
		} else {
			for(v = check,inc = 0;v != 0;v >>= 1) if(v & 1) inc++;//bitcount	
		}
		if(check + inc <= N && memo[check + inc] == false){
			q.push(check + inc);
			count++;
			continue;
		}
		if(0 < check - inc && memo[check - inc] == false){
			q.push(check - inc);
			count++;
			continue;
		}
		count--;
	}
	cout << -1 << endl;
}