#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())

#if defined(_MSC_VER)||defined(__SSE4_2__)
#include<nmmintrin.h>
#endif

int popcount32(unsigned int x){
#if defined(_MSC_VER)
	return __popcnt(x);
#elif defined(__GNUC__)
	return __builtin_popcount(x);
#else 
	x = x - (( x >> 1 ) & 0x55555555);
	x = (x & 0x33333333) + (( x >> 2) & 0x33333333);
	x = ( x + ( x >> 4 )) & 0x0F0F0F0F;
	x = x + ( x >> 8 );
	x = x + ( x >> 16 );
	return x & 0x0000003F;
#endif
}



int dp[10001];

int main(){
	int n;
	cin>>n;
	fill(dp,dp+n+1,INF);
	priority_queue<pair<int,int> ,vector<pair<int,int> >,greater<pair<int,int> > > pq;
	int ans=-1;
	pq.push(make_pair(1,1));
	while(!pq.empty()){
		pair<int,int> p=pq.top();
		pq.pop();
		if(p.second==n){
			ans=p.first;
			break;
		}
		for(int sign=-1;sign<=1;sign+=2){
			int dest=p.second+sign*popcount32(p.second);
			if(1<=dest&&dest<=n&&p.first+1<dp[dest]){
				dp[dest]=p.first+1;
				pq.push(make_pair(p.first+1,dest));
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}