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

#define lp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) lp(i, 0, n)
#define rlp(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define rrep(i, n) rlp(i, 0, n)

#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(c) begin(c), end(c)

typedef long long ll;
typedef unsigned long long ull;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};

const int MOD = 1e9 + 7;
const int INF = 1 << 28;
const ll INFLL = 1ll << 60;

template<typename T>
inline void unique(T &c){
	sort(all(c));
	c.erase(unique(all(c)), end(c));
}

int n;
int a[10010];
int dist[10010];

int main()
{
	cin >> n;
	rep(i, n + 1){
		a[i] = __builtin_popcount(i);
	}
	
	memset(dist, -1, sizeof(dist));

	queue<int> q;
	dist[1] = 1;
	q.push(1);
	while (q.size()){
		int c = q.front(); q.pop();
		if (c == n) continue;
		for (int nx : {c + -a[c], c + a[c]}){
			if (nx < 0 || nx > n) continue;
			if (dist[nx] == -1){
				dist[nx] = dist[c] + 1;
				q.push(nx);
			}
		}
	}

	cout << dist[n] << endl;
}