#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;


int get_bits(int num) {
	int count = 0;
	int tmp = num;
	while(tmp) {
		if (tmp & 1) {
			count++;
		}
		tmp >>= 1;
	}
	return count;
}

int main() {
	int n;
	cin >> n;

	vector<int> move(n + 1, -1);
	move[0] = 0;

	queue <int> que;

	que.push(1);
	move[1] = 1;

	while (!que.empty()) {
		int now = que.front();
		que.pop();

		if (now == n) {
			break;
		}

		int diff = get_bits(now);

		int next1 = now + diff;
		int next2 = now - diff;

		if (move[next1] == -1 && 0 < next1 && next1 <= n) {
			move[next1] = move[now] + 1;
			que.push(next1);
		}
		if (move[next2] == -1 && 0 < next2 && next2 <= n) {
			move[next2] = move[now] + 1;
			que.push(next2);
		}
	}

	cout << move[n] << endl;
	return 0;
}