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

int N,w[10001],dist[10001];
bool e[10001];
queue<int> Qu;

int main(){

				cin >> N;

				for(int i = 1; i <= N; i++)	e[i] = false;
				for(int i = 1; i <= N; i++) dist[i] = 1;
				for(int i = 1; i <= N; i++){
								int tw = 1;
								int t = i;
								while(t != 1){
												if(t%2) tw++;
												t /= 2;
								}
								w[i] = tw;
				}

				Qu.push(1);
				e[1] = true;

				while(!Qu.empty()){

								int t = Qu.front();
								Qu.pop();

								if(t == N){
											 	cout << dist[t] << endl;
												return 0;
								}

								if(t + w[t] <= N && !e[t + w[t]]){
												Qu.push(t + w[t]);
												e[t + w[t]] = true;
												dist[t + w[t]] = dist[t] + 1;
								}
								if(t - w[t] > 0 && !e[t - w[t]]){
												Qu.push(t - w[t]);
												e[t - w[t]] = true;
												dist[t - w[t]] = dist[t] + 1;
								}
				}
				cout << -1 << endl;
				return 0;
}