#include <iostream>
#include <queue>

using namespace std;

int count(int a) {
	int b = a;
	int i = 0;
	for (; b != 0; b /= 2) {
		i += b % 2;
	}
	return i;
}



int main() {
	int n;
	cin >> n;
	queue<int> que;
	vector<int> dist(n+3, -1);
	dist[1] = 1;
	que.push(1);
	while (!que.empty()) {
		int p = que.front();
		que.pop();
		int i = count(p);
		if ((p - i) < 1);
		else if (dist[p - i] == -1) {
			que.push(p - i);
			dist[p - i] = dist[p] + 1;
		}
		if ((p + i) > n);
		else if (dist[p + i] == -1) {
			que.push(p + i);
			dist[p + i] = dist[p] + 1;
		}
	}
	cout << dist[n];
}