#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
#define INF 1<<25

int count1(int a){
	int cnt=0;
	while(a){
		if(a&1)	cnt++;
		a>>=1;
	}
	return cnt;
}

int main(){
	int n;	cin>>n;
	int search[n+1];
	int num[n];
	for(int i=0;i<n;i++){
		search[i]=INF;
		num[i]=count1(i+1);
	}
	search[0]=1;
	queue<int> sta;	sta.push(0);
	while(search[n-1]==INF&&sta.size()!=0){
		int cur=sta.front();	sta.pop();
		if(cur+num[cur]<n){
			if(search[cur+num[cur]]>search[cur]+1){
				search[cur+num[cur]]=search[cur]+1;
				sta.push(cur+num[cur]);
			}
		}
		if(cur-num[cur]>0){
			if(search[cur-num[cur]]>search[cur]+1){
				search[cur-num[cur]]=search[cur]+1;
				sta.push(cur-num[cur]);
			}
		}
	}
	if(search[n-1]==INF)	search[n-1]=-1;
	cout<<search[n-1]<<endl;
	return 0;
}