#include<iostream>
#include<queue>

using namespace std;

#define NMAX 10000

int bitcount1(int n){
	int c=0;
	while(n!=0){
		/*cout<<n<<"-"<<c<<endl;*/
		if(n%2==1) c++;
		n=n>>1;
	}
	return c;
}

int main(){

	int N;
	int dp[NMAX+1];
	queue<int> n;

	cin>>N;

	for(int i=1;i<=N;i++){
		dp[i]=NMAX+1;
	}

	n.push(1);
	dp[1]=1;

	while(!n.empty()){
		int mas=n.front();
		n.pop();
		int dot=bitcount1(mas);
		/*cout<<mas<<","<<dot<<endl;*/
		if(mas-dot>=1&&dp[mas]+1<dp[mas-dot]){
			dp[mas-dot]=dp[mas]+1;
			n.push(mas-dot);
		}
		if(mas+dot<=N&&dp[mas]+1<dp[mas+dot]){
			dp[mas+dot]=dp[mas]+1;
			n.push(mas+dot);
		}
	}

	if(dp[N]==NMAX+1) cout<<"-1"<<endl;
	else cout<<dp[N]<<endl;
}