#include <iostream>
#include <algorithm>
#include <queue>

const int max = 10001;

int n;

int popCount(int n){
	int cnt = 0;
	while (n != 0){
		cnt += (n & 1 ? 1 : 0);
		n /= 2;
	}
	return cnt;
}

int bfs(){
	int map[max];
	for (int i = 0; i < max; ++i)map[i] = -1;
	map[1] = 1;
	std::queue<int> que;
	que.push(1);
	while (!que.empty()){
		int q = que.front();
		que.pop();
		int p = popCount(q);
		if (q - p >= 1 && map[q - p] == -1)map[q - p] = map[q] + 1, que.push(q - p);
		if (q + p <= n && map[q + p] == -1)map[q + p] = map[q] + 1, que.push(q + p);
	}
	return map[n];
}


int main(){
	std::cin >> n;
	std::cout << bfs() << std::endl;
	return 0;
}