#include<iostream>
#include<algorithm>
using namespace std;

int main(){
	long long n,a,o=0;
	cin>>n;
	long long dp[n],b[n],c[n];
	for(int i=0;i<n;i++){
		dp[i]=10000;
		b[i]=0;
		c[i]=0;
		a=i+1;
		while(a>0){
			b[i]+=a%2;
			a/=2;
		}
	}
	dp[0]=1;
	for(int i=0;i<n-1;i++){
		if(dp[i]!=10000){
			if(i+b[i]<n){
				dp[i+b[i]]=dp[i]+1;
				c[i+b[i]]=1;
			}
		}
	}
	if(dp[n-1]!=10000)cout<<dp[n-1]<<endl;
	else{
		while(o!=0){
			o=0;
			for(int i=0;i<n;i++){
				if(c[i]==1){
					c[i]=0;
					if(i+b[i]<n){
						if(dp[i+b[i]]>dp[i]+1){
							dp[i+b[i]]=dp[i]+1;
							c[i+b[i]]=1;
							o++;
						}
					}
					if(i+b[i]>0){
						if(dp[i-b[i]]>dp[i]+1){
							dp[i-b[i]]=dp[i]+1;
							c[i-b[i]]=1;
							o++;
						}
					}
				}
			}
		}
		if(dp[n-1]==10000)dp[n-1]=-1;
		cout<<dp[n-1]<<endl;
	}
}