#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

#define MAX 10000
#define INF 1000000007

int N;
int dist[MAX + 1];

void bfs(int start) {
	queue<int> q;
	dist[start] = 1;
	q.push(start);
	while (!q.empty()) {
		int x = q.front();
		q.pop();
		int cnt = __builtin_popcount(x);
		if (x + cnt <= N) {
			if (dist[x] + 1 < dist[x + cnt]) {
				dist[x + cnt] = dist[x] + 1;
				q.push(x + cnt);
			}
		}
		if (0 < x - cnt) {
			if (dist[x] + 1 < dist[x - cnt]) {
				dist[x - cnt] = dist[x] + 1;
				q.push(x - cnt);
			}
		}
	}
}

int main() {
	cin >> N;
	
	for (int i = 2; i <= N; i++) dist[i] = INF;
	
	bfs(1);
	
	cout << (dist[N] == INF ? -1 : dist[N]) << '\n';
	
	return 0;
}