#include <bits/stdc++.h>
using namespace std;

#define INF 2000000000

int BitCount(int64_t x) {
	x = (x & 0x5555555555555555) + (x >>  1 & 0x5555555555555555);
	x = (x & 0x3333333333333333) + (x >>  2 & 0x3333333333333333);
	x = (x & 0x0f0f0f0f0f0f0f0f) + (x >>  4 & 0x0f0f0f0f0f0f0f0f);
	x = (x & 0x00ff00ff00ff00ff) + (x >>  8 & 0x00ff00ff00ff00ff);
	x = (x & 0x0000ffff0000ffff) + (x >> 16 & 0x0000ffff0000ffff);
	x = (x & 0x00000000ffffffff) + (x >> 32 & 0x00000000ffffffff);
	return (int)(x);
}

int N;
int x[10000];

void recursive(int pos, int t) {
	if(pos < 0 || pos > N) return;
	if(x[pos] < t) return;
	else x[pos] = t; 
	int d = BitCount(pos + 1);
	recursive(pos + d, t + 1);
	recursive(pos - d, t + 1);
}

int main() {
	cin >> N;
	for(int i = 0; i < N; i++) {
		x[i] = INF;
	}
	recursive(0, 0);
	if(x[N - 1] == INF) x[N - 1] = -2;
	cout << x[N - 1] + 1 << endl;
	return 0;
}