#include <iostream>
#include <queue>
using namespace std;

int BinaryCount(int a) {
	/*int count = 0;
	while (n > 0) {
	count += n % 2;
	n /= 2;
	}
	return count;*/

	int cnt = 0;
	while (a>0) {
		cnt++;
		a &= a - 1;
	}
	return cnt;

}

class Data {
public:
	int p, kind;
	Data(){}
	Data(int p, int kind) {
		this->p = p;
		this->kind = kind;
	}
	void set(int a, int b) {
		p = a;
		kind = b;
	}
};

int main(void) {
	int n;
	cin >> n;

	bool* flag = new bool[n];
	for (int i = 0; i < n; ++i) {
		flag[i] = false;
	}

	int hosuu;
	queue<Data> q;
	Data d(1, 1);
	Data out;
	q.push(d);
	do {
		d = q.front(); q.pop();
		if (d.p == n) {
			cout << d.kind << endl;
			return 0;
		}
		flag[d.p - 1] = true;
		hosuu = BinaryCount(d.p);
		if (d.p - hosuu > 0 && !flag[d.p - 1 - hosuu]) {
			out.set(d.p - hosuu, d.kind + 1);
			q.push(out);
		}
		if (d.p + hosuu <= n && !flag[d.p - 1 + hosuu]) {
			out.set(d.p + hosuu, d.kind + 1);
			q.push(out);
		}
	} while (!q.empty());

	cout << "-1" << endl;

	return 0;
}