#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<random>
#include<bitset>
#include<cassert>
#include<complex>
#include<fstream>
#include<cstdlib>
#include<functional>
#include<array>
using namespace std;
typedef long long ll;
const int mod=998244353;
const int dx[]={1,0,0,-1},dy[]={0,1,-1,0};
int dist[10001];
int main(){
	int n;
	cin>>n;
	fill(dist+2,dist+n+1,-1);
	dist[1]=1;
	queue<int>que;
	que.push(1);
	while(que.size()){
		int v=que.front();
		que.pop();
		int pc=__builtin_popcount(v);
		if(v+pc<=n&&dist[v+pc]==-1){
			dist[v+pc]=dist[v]+1;
			que.push(v+pc);
		}
		if(v-pc>=1&&dist[v-pc]==-1){
			dist[v-pc]=dist[v]+1;
			que.push(v-pc);
		}
	}
	cout<<dist[n]<<endl;
}