#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1ll<<60;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int count(int a){
	int out=0;
	while(a){
		if(a%2)out++;
		a/=2;
	}
	return out;
}
int main(){
	int n;
	cin>>n;
	vi dp(n+1);
	dp[1]=1;
	queue<int>que;
	que.push(1);
	while(!que.empty()){
		int a=que.front();
		que.pop();
		if(a==n){
			cout<<dp[n]<<endl;
			return 0;
		}
		int co=count(a);
		if(a-co>0&&dp[a-co]==0){
			dp[a-co]=dp[a]+1;
			que.push(a-co);
		}
		if(a+co<=n&&dp[a+co]==0){
			dp[a+co]=dp[a]+1;
			que.push(a+co);
		}
	}
	cout<<-1<<endl;
}