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

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1000000007;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2018/04/06  Problem: yukicoder 003  / Link: http://yukicoder.me/problems/no/003  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----



----解説ここまで---- */

LL N;

LL ans = 0LL;

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

	cin >> N;

	VI dist(N + 1, INF);
	queue<PII>q;
	dist[1] = 1;
	q.push(PII(1, 1));

	while (!q.empty()) {
		int now = q.front().first;
		int ti = q.front().second;
		q.pop();
		if (now == N) {
			ans = ti;
			break;
		}
		int ad = __builtin_popcount(now);
		if (now - ad > 0 && dist[now - ad] > ti + 1) {
			q.push(PII(now - ad, ti + 1));
			dist[now - ad] = ti + 1;
		}

		if (now + ad <= N && dist[now + ad] > ti+1) {
			q.push(PII(now + ad, ti + 1));
			dist[now + ad] = ti + 1;
		}
	}
	if (ans == 0)ans = -1;
	cout << ans << "\n";

	return 0;
}