#include <iostream>
#include <vector>
#include <queue>
// #include <bits/stdc++.h>
using namespace std;

int main() {

	const int INF = 1000000;

	int n;
	cin >> n;

	vector<int> d(n+1, INF);
	queue<int>	que;

	que.push(1);
	d.at(1) = 1;

	while (que.size()) {
		int	tmp = que.front();
		que.pop();

		if (tmp == n)
			break;

		int step = 0;
		for (int i = tmp; i > 0; i = i >> 1) {
			if (i & 1) step++;
		}

		if (tmp + step <= n && d.at(tmp + step) == INF) {
			que.push(tmp + step);
			d.at(tmp + step) = d.at(tmp) + 1;
		}
		if (tmp - step >= 1 && d.at(tmp - step) == INF) {
			que.push(tmp - step);
			d.at(tmp - step) = d.at(tmp) + 1;
		}

	}

	if (d.at(n) == INF)
		cout << -1 << endl;
	else
		cout << d.at(n) << endl;

	
	return 0;
}