#include <iostream>
#include <vector>

using namespace std;

int N;

int bitCount(int n) {
	int count = 0;
	while (n > 0) {
		if (n & 1) count++;
		n = n >> 1;
	}
	return count;
}

int minResult = 99999999;
int result = 0;
bool found = false;
vector<bool> visit;

void solve(int p) {
	visit[p] = true;
	++result;

	int bitNum = bitCount(p);
	if (p + bitNum == N) {
		found = true;
		if (result + 1 < minResult) {
			minResult = result + 1;
		}
		return;
	}
	if (p + bitNum < N) {
		if (!visit[p + bitNum]) {
			solve(p + bitNum);
//			--result;
		}
	}
	if (p - bitNum > 0) {
		if (!visit[p - bitNum]) {
			solve(p - bitNum);
//			--result;
		}
	}
}

int main() {
	cin >> N;

	if (N == 1) {
		cout << 1 << endl;
		return 0;
	}

	visit.resize(N + 1);

	solve(1);

	if (!found) {
		cout << -1 << endl;
	} else {
		cout << minResult << endl;
	}
}