#include <bits/stdc++.h>


using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 1 << 30;
const ll INFL = 1LL<<60;
const ll mod = 1000000007;		





int main() {
	vector<bool> used(10050, false);
	VI v(10050, 0);
	VI ans(10050, INF);
	int n;

	cin >> n;


	FOR(i, 1, 10001) {
		int j = i;
		while (j) {
			v[i] += j % 2;
			j /= 2;
		}
	}
	
	queue<pair<int,int>> q;

	q.push({ 1, 1 });

	while (!q.empty()) {
		pair<int, int> p = q.front();
		used[p.first] = true;
		q.pop();
		ans[p.first] = min(ans[p.first], p.second);
		if (p.first - v[p.first] > 0) {
			if (!used[p.first - v[p.first]]) {
				q.push({ p.first - v[p.first],p.second + 1 });
			}
		}
		if (p.first + v[p.first] <= n) {
			if (!used[p.first + v[p.first]]) {
				q.push({ p.first + v[p.first],p.second + 1 });
			}
		}
	}


	if (ans[n] == INF)cout << -1 << endl;
	else cout << ans[n] << endl;

	return 0;
}