#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;

int n;
bool visited[100010];
int step[100010];

bool check(int p) {
	bool ok = true;
	if (visited[p])ok = false;
	if (p < 1)ok = false;
	if (p > n)ok = false;
	return ok;
}

int count(int a) {
	int sum = 0;
	for (int i = 0; (a >> i) > 0; i++) {
		sum += ((a >> i) & 1);
	}
	return sum;
}

bool solve(int p) {
	bool ok = false;
	queue<int> q;
	q.push(p);

	step[1] = 1;
	while (!q.empty()) {
		int np = q.front();
//		cerr << np << endl;
		q.pop();
	
		if (np == n)ok = true;
		int npp1 = np + count(np);
		if (check(npp1)) {
			visited[npp1] = true;
			step[npp1] = min(step[npp1], step[np] + 1);
			q.push(npp1);
		}

		npp1 = np - count(np);
		if (check(npp1)) {
			visited[npp1] = true;
			step[npp1] = min(step[npp1], step[np] + 1);
			q.push(npp1);
		}
	}
	return ok;
}

int main() {
	cin >> n;
	for (int i = 0; i < 1e5 + 10; i++) {
		visited[i] = false;
		step[i] = 1e9;
	}
	
	cout << (solve(1) ? step[n] : -1) << endl;
}