#include "bits/stdc++.h"

using namespace std;

using ll = long long int;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;

const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

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

int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

int bitCnt(int now) {
	int v = now, cnt = 0;
	while (v > 0) {
		if (v & 1) {
			cnt++;
		}
		v /= 2;
	}

	return cnt;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;

	vi dp(n + 1, INF);
	dp[1] = 1;
	queue<int> que;
	que.push(dp[1]);

	while (!que.empty()) {
		int now = que.front(); que.pop();
		int move = bitCnt(now);
		for (int i = -move; i <= move; i += 2 * move) {
			int next = now + i;
			if (next < 1 || next > n) {
				continue;
			}
			if (dp[next] != INF) {
				continue;
			}
			dp[next] = dp[now] + 1;
			que.push(next);
		}
	}

	cout << (dp[n] == INF ? -1 : dp[n]) << endl;
	return 0;
}