#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;

long long dp[10005] = {};
int N;

int f(int num) {
	int ret = 0;
	for (int i = 0; i < 32; i++) {
		if ((num >> i) & 1 == 1) ret++;
	}
	return ret;
}

/*
int dfs(int num) { //numまで何歩でいけるかかえす。
	if (num == 1) {
		//cout << "dp[" << num << "]: " << 1 << endl;
		return dp[1] = 1;
	}
	if (dp[num] != -1) {
		return dp[num];
	}
	for (int i = 1; i <= N; i++) {	//from i to num
		if (i + f(i) == num || i - f(i) == num) {
			//cout << "from i:" << i<<" to "<<num<<endl;
			long long tmp = dp[num];
			if (dp[num] == -1) tmp = (1<<30);
			if(dfs(i) != -1) dp[num] = min(tmp, dp[num] = dfs(i) + 1);
			//cout << "dp[" << num << "]: " << dp[num] << endl;
		}
	}
	return dp[num];
}
*/

int main() {
	cin >> N;

	/*
	for (int i = 1; i <= N; i++) dp[i] = -1;
	dfs(N);
	cout << dp[N] << endl;
	*/

	for (int i = 1; i <= N; i ++) dp[i] = (1<<30);

	queue<int> q;
	q.push(1);
	dp[1] = 1;
	while (!q.empty()) {
		int pos = q.front(); q.pop();
		int mov = f(pos);
		for (int i = -mov; i <= mov; i += 2*mov) {
			int next = pos + i;
			if (next < 1 || N < next) continue;
			if (dp[next] != (1 << 30)) continue;
			dp[next] = dp[pos] + 1;
			q.push(next);
		}
	}

	if(dp[N] == (1<<30)) cout << -1 << endl;
	else cout << dp[N] << endl;

	return 0;
}