#include <iostream>
#include <vector>
#include <set>

using namespace std;

int N;

bool input(istream& in)
{
	if (!(in >> N)) return false;
	return true;
}

int bit_count(int num)
{
	num = (num & 0x55555555) + ((num & 0xAAAAAAAA) >> 1);
	num = (num & 0x33333333) + ((num & 0xCCCCCCCC) >> 2);
	num = (num & 0x0F0F0F0F) + ((num & 0xF0F0F0F0) >> 4);
	num = (num & 0x00FF00FF) + ((num & 0xFF00FF00) >> 8);
	num = (num & 0x0000FFFF) + ((num & 0xFFFF0000) >> 16);
	return num;
}

int resolve()
{
	vector<int> visit(N + 1);

	set<int> positions;
	positions.insert(1);

	for (int step = 1; step <= N; step++) {
		set<int> next;
		for (int pos : positions) {
			if (visit[pos] == 0) {
				if (pos == N) return step;
				visit[pos] = step;
				int distance = bit_count(pos);
				if (1 <= pos - distance) {
					next.insert(pos - distance);
				}
				if (pos + distance <= N) {
					next.insert(pos + distance);
				}
			}
		}
		positions.swap(next);
	}

	return -1;
}

int main(int argc, char **argv)
{
	while (input(cin)) {
		cout << resolve() << endl;
	}
	return 0;
}