#include <stdio.h>

#define MAX 10000

int bit_count(int);
void search();

int n, memo[MAX + 1], queue[MAX + 1]; // 例によって0初期化

int main(void) {
	scanf("%d", &n);
	search();
	printf("%d\n", memo[n] ? memo[n] : -1); // 到達できない時は0と考えた方が自然な気がする
	return 0;
}

int bit_count(int n) {
	int cnt = 0;
	while(n) {
		cnt += n % 2;
		n /= 2;
	}
	return cnt;
}

void search() {
	int get = 0, set = 0;
	memo[1] = 1;
	queue[set] = 1;
	set++;
	while(get != set) {
		int c = queue[get], b = bit_count(c);
		int l = c - b, r = c + b;
		if(c == n) { break; }
		if(0 <= l && memo[l] == 0) {
			memo[l] = memo[c] + 1;
			queue[set] = l;
			set++;
		}
		if(r <= n && memo[r] == 0) {
			memo[r] = memo[c] + 1;
			queue[set] = r;
			set++;
		}
		get++;
	}
}