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

#define N 10000

int count_bit(unsigned int x)
{
	x = (x & 0b01010101010101010101010101010101) + ((x >> 1)  & 0b01010101010101010101010101010101);
	x = (x & 0b00110011001100110011001100110011) + ((x >> 2)  & 0b00110011001100110011001100110011);
	x = (x & 0b00001111000011110000111100001111) + ((x >> 4)  & 0b00001111000011110000111100001111);
	x = (x & 0b00000000111111110000000011111111) + ((x >> 8)  & 0b00000000111111110000000011111111);

	return x;
}

int main()
{
	int goal;
	cin >> goal;

	queue<int> q;
	q.push(0);

	int visit[N] = { 1, };

	while ( !q.empty() ) {
		int target = q.front();
		q.pop();
		if ( target == goal - 1 ) {
			cout << visit[target] << endl;
			return 0;
		}
		int bits = count_bit(target + 1);
		if ( target + bits < goal && !visit[target + bits] ) {
			visit[target + bits] = visit[target] + 1;
			q.push(target + bits);
		}
		if ( target - bits >= 0 && !visit[target - bits] ) {
			visit[target - bits] = visit[target] + 1;
			q.push(target - bits);
		}
	}

	cout << -1 << endl;

	return 0;
}