#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <climits>

using namespace std;

int parseInt() {
	string line;
	getline(std::cin, line);

	size_t parsed;
	int const N = stoi(line, &parsed);
	if (parsed != line.size()) {
		cout << "Malformed integer input: " << line << endl;
		exit(1);
	}

	return N;
}

size_t popcnt(int n) {
	int i;
	for (i = 0; n; ++i) {
		n &= n - 1;
	}
	return i;
}

int main(void) {
	int const N = parseInt();
	vector<int> dists(N, INT_MAX);
	dists[0] = 1;
	deque<size_t> q = { 1 };

	auto const check = [&](int const next, size_t const new_steps) {
		auto index = next - 1;
		if (next > 0 && next <= N && new_steps < dists[index]) {
			dists[index] = new_steps;
			q.push_back(next);
		}
	};

	while (q.size()) {
		size_t const val = q.front();
		q.pop_front();
		auto const new_steps = dists[val - 1] + 1;
		if (new_steps > N) {
			continue;
		}
		else if (val == N) {
			cout << to_string(dists[val - 1]) << endl;
			return 0;
		}

		size_t const c = popcnt(val);
		check(val - c, new_steps);
		check(val + c, new_steps);
	}
	cout << (dists.back() < INT_MAX ? to_string(dists.back()) : "-1") << endl;
	return 0;
}