#include <iostream>
#include <vector>
#include <queue>

using namespace std;

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

int main() {
	int num;
	queue<int> qu;
	cin >> num;
	vector<int> count(num + 1, 0);
	count[1] = 1;
	qu.push(1);

	while (!qu.empty()) {
		int x = qu.front();qu.pop();
		int key = numofbits(x);
		int next_l = x - key, next_r = x + key;

		if (next_l >= 1 && next_l <= num) {
			if (count[next_l] == 0) {
				count[next_l] = count[x] + 1;
				qu.push(next_l);
			}
		}

		if (next_r >= 1 && next_r <= num) {
			if (count[next_r] == 0) {
				count[next_r] = count[x] + 1;
				qu.push(next_r);
			}
		}
	}

	if (count[num] == 0) {
		cout << -1 << endl;
	}
	else {
		cout << count[num] << endl;
	}
	return 0;
}