#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>

#define SIZE 100

using namespace std;

/* 1のビット数 */
int numofbits(long bits)
{
    bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
    bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
    bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
    bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
    return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}

int main()
{
	int d[SIZE];
	int N;
	queue<int> que;

	cin >> N;

	memset(d, -1, sizeof(d));
	
	que.push(1);
	d[1] = 1;

	while (que.size()) {
		int p = que.front();
		que.pop();

		int n = p + numofbits(p);
		if (0 < n && n <= N && d[n] == -1) {
			que.push(n);
			d[n] = d[p] + 1;
		} 
		n = p - numofbits(p);
		if (0 < n && n <= N && d[n] == -1) {
			que.push(n);
			d[n] = d[p] + 1;
		} 
	}

	cout << d[N] << endl;
}