#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<cstdio>
#include<iostream>
using namespace std;

bool flag[10010];
int kaisuu[10010];
static const int INF = 1e8;


int bitcnt(int now){
	int ans = 0;
	while(now > 0){
		if(now % 2 == 1)
			ans++;
		now = now/2;
	}
	return ans;
}

int main(){
	for(int i = 0;i < 10010;i++){
		flag[i] = false;
		kaisuu[i] = INF;
	}

	kaisuu[1] = 1;
	int n;
	cin >> n;

	queue<int> q;
	q.push(1);
	while(!q.empty()){
		int now = q.front();
		q.pop();
		if(flag[now]) continue;
		flag[now] = true;
		int d = bitcnt(now);


		if(1 <= now -d && now - d <= n && flag[now - d] == false){
			kaisuu[now - d] = min(kaisuu[now] + 1, kaisuu[now -d]);
			q.push(now -d);

		}


		if(1 <= now + d && now + d <= n && flag[now + d] == false){
			kaisuu[now + d] = min(kaisuu[now] + 1, kaisuu[now + d]);
			q.push(now + d);
		}
	}

	if(flag[n]) cout << kaisuu[n] << endl;
	else cout << -1 << endl;

	return 0;
}