#include<iostream>
#include<queue>
#define INF 100000000
using namespace std;

int bitpop(int bit);

int main()
{
	int n, *cells, i, c_n, c_bitpop,ans;
	cin >> n;
	cells = new int[n];
	for (i = 0; i < n; ++i)cells[i] = INF;
	queue<int> que;
	que.push(0);
	cells[0] = 1;
	while (que.size())
	{
		c_n = que.front(); que.pop();
		c_bitpop = bitpop(c_n+1);
		if (c_n + c_bitpop == n - 1) {
			cells[c_n + c_bitpop] = cells[c_n] + 1;
			break;
		}
		if (c_n + c_bitpop <= n - 2 && cells[c_n + c_bitpop] == INF) {
			cells[c_n + c_bitpop] = cells[c_n] + 1;
			que.push(c_n + c_bitpop);
		}
		if (0 <= c_n - c_bitpop  && cells[c_n - c_bitpop] == INF) {
			cells[c_n - c_bitpop] = cells[c_n] + 1;
			que.push(c_n - c_bitpop);
		}
	}
	ans = cells[n - 1] == INF ? -1 : cells[n - 1];
	cout << ans << endl;
	delete[] cells;
	return 0;
}

int bitpop(int bit)
{
	bit = (bit & 0x55555555) + (bit >> 1 & 0x55555555);
	bit = (bit & 0x33333333) + (bit >> 2 & 0x33333333);
	bit = (bit & 0x0f0f0f0f) + (bit >> 4 & 0x0f0f0f0f);
	bit = (bit & 0x00ff00ff) + (bit >> 8 & 0x00ff00ff);
	return (bit & 0x0000ffff) + (bit >> 16 & 0x0000ffff);
}