#include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
#include<ctime>
#include<set>
using namespace std;


#define li			long long int
#define rep(i,to)	for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)	for(li i=(li)(start);i<((li)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define F first
#define S second
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl

li visit[10101];

li cnt_binary(li x){
	li res=0;
	rep(i,32){
		if(((1ll<<i)&x)>0)res++;
	}
	return res;
}

int main(){
	li n;
	cin>>n;
	rep(i,n)visit[i]=-1;

	queue<pair<li, li> > q;
	q.push(mp(0,1));
	while(!q.empty()){
		li now=q.front().F;
		li cost_now=q.front().S;
		q.pop();
		if(visit[now]>0)continue;
		visit[now]=cost_now;
		li kaz=cnt_binary(now+1);
		if(now-kaz>=0 && visit[now-kaz]<0)q.push(mp(now-kaz, cost_now+1));
		if(now+kaz>=0 && visit[now+kaz]<0)q.push(mp(now+kaz, cost_now+1));
	}

	//rin{cout<<visit[i]<<endl;}

	cout<<visit[n-1]<<endl;

	return 0;
}