// yukicoder: No.3 ビットすごろく
// 2019.4.7 bal4u
// popcount + bfs

#include <stdio.h>

/* 2^16までのビット数を数える */
int bitcount(int x)
{
	x = ((x & 0xAAAAAA) >> 1) + (x & 0x555555);
	x = ((x & 0xCCCCCC) >> 2) + (x & 0x333333);
	x = ((x & 0xF0F0F0) >> 4) + (x & 0x0F0F0F);
	x = ((x & 0x00FF00) >> 8) + (x & 0xFF00FF);
	return x;
}

#define MAX 10005
int b[MAX];

typedef struct { int n, s; } Q;
Q q[MAX]; int top, end;
char vis[MAX];

int bfs(int start, int goal)
{
	int n, s, nx;

	q[0].n = start, q[0].s = 1, top = 0, end = 1;
	while (top != end) {
		n = q[top].n, s = q[top++].s;
		if (n == goal) return s;
		if (vis[n]) continue;
		vis[n] = 1;
		nx = n + b[n];
		if (nx <= goal && !vis[nx]) q[end].n = nx, q[end++].s = s + 1;
		nx = n - b[n];
		if (nx >= start && !vis[nx]) q[end].n = nx, q[end++].s = s + 1;
	}
	return -1;
}

int main()
{
	int i, N;

	for (i = 1; i < MAX; i++) b[i] = bitcount(i); // 前計算
	scanf("%d", &N);
	printf("%d\n", bfs(1, N));
	return 0;
}