#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define mp make_pair
#define fi first
#define sc second
#define INF 1000000000
int n;

struct edge { int to, cost; };
typedef pair<int, int> P;
int V;
vector<edge> G[20000];
int d[20000];
void dijkstra(int s) {
	priority_queue<P, vector<P>, greater<P> > que;
	fill(d, d + V, INF);
	d[s] = 0;
	que.push(P(0, s));
	while (!que.empty()) {
		P p = que.top(); que.pop();
		int v = p.second;
		if (d[v] < p.first) continue;
		for (int i = 0; i < G[v].size(); i++) {
			edge e = G[v][i];
			if (d[e.to] > d[v] + e.cost) {
				d[e.to] = d[v] + e.cost;
				que.push(P(d[e.to], e.to));
			}
		}
	}
}

int main(){
	cin >> n;
	FOR(i,1,n + 1){
		if(i + __builtin_popcount(i) <= n){
			G[i].pb((edge){i + __builtin_popcount(i),1});
		}
		if(i - __builtin_popcount(i) > 0){
			G[i].pb((edge){i - __builtin_popcount(i),1});
		}
	}
	V = n + 1;
	dijkstra(1);
	ll ans = d[n];
	if(ans >= INF)
		ans = -1;
	else
		ans++;
	cout << ans << endl;
	return 0;
}