#include<iostream>
#include<queue>
using namespace std;

int binary(int bina)
{
	int count = 0;

	while (bina > 0)
	{
		if (bina % 2 == 1) count++;
		bina /= 2;
	}
	return count;
}

int main()
{
	int n, dis[10001];
	cin >> n;

	queue<int> que;
	for (int i = 0; i < 10001; i++) dis[i] = -1;
	que.push(1);
	dis[1] = 1;

	while (que.size())
	{
		int now = que.front();
		que.pop();
		int bit = binary(now);

		if (now - bit > 0 && dis[now - bit] == -1)
		{
			dis[now - bit] = dis[now] + 1;
			que.push(now - bit);
		}
		
		if (now + bit <= n && dis[now + bit] == -1)
		{
			dis[now + bit] = dis[now] + 1;
			que.push(now + bit);
		}
	}

	cout << (dis[n] > -1 ? dis[n] : -1) << endl;
}