#include<iostream>
#include<queue>
using namespace std;
typedef long long LL;
int popcount(int x) {
	int ret = 0;
	while (x) { x &= x - 1; ++ret; }
	return ret;
}
int dp[10001];
int main() {
	int n; cin >> n;
	fill(dp, dp + 10001, -1);
	dp[1] = 1;
	queue<int> q;
	q.push(1);
	while (!q.empty()) {
		int x = q.front(); q.pop();
		int d = popcount(x);
		if (x - d > 0) {
			if (dp[x - d] == -1) {
				dp[x - d] = dp[x] + 1;
				q.push(x - d);
			}
		}
		if (x + d <= n) {
			if (dp[x + d] == -1) {
				dp[x + d] = dp[x] + 1;
				q.push(x + d);
			}
		}
	}
	cout << dp[n] << endl;
	return 0;
}