#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;

#define INF 10000000
 
typedef struct{
	int to;
	int cost;
}edge;

//distance from s
//O(E log V)
void dijkstra(vector<vector<edge> > &G, vector<int> &dist, int s){
	//first : distance from s, second : its vertex
	priority_queue< pair<int,int> , vector<pair<int,int> >, greater< pair<int,int> > > pq;
	 
	fill(dist.begin(), dist.end(), INF);
	dist[s] = 0;
	pq.push( make_pair(dist[s], s) );
	while(!pq.empty()){
		pair<int,int> q = pq.top();
		pq.pop();
		int from = q.second;
		if(dist[from] < q.first) continue; // it's not minimum distance
		int n=G[from].size();
		for(int i=0; i<n; i++){
			edge e = G[from][i];
			if(dist[e.to] > dist[from] + e.cost){
				dist[e.to] = dist[from] + e.cost;
				pq.push( make_pair(dist[e.to], e.to) );
			}
		}
	}
}
 
void add_edge(vector<vector<edge> > &G, int from, int to, int cost){
	G[from].push_back( (edge){to, cost} );
	//G[to].push_back( (edge){from, cost} );
}


int bits(int n){
	int ret = 0;
	while( n>0 ){
		ret++;
		n -= n&-n;
	}
	return ret;
}

int main(){
	int n;
	cin >> n;
	
	vector<vector<edge> > G(n+1);
	
	for(int i=1; i<=n; i++){
		int d = bits(i);
		if(i-d > 0) add_edge(G, i, i-d, 1);
		if(i+d <= n) add_edge(G, i, i+d, 1);
	}

	vector<int> dist(n+1);
	dijkstra(G, dist, 1);
	int ans = (dist[n]>=INF?-1:dist[n]+1);
	cout << ans << endl;
	return 0;
}