#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
int N,d[10001],inf=1e9,x[10001];
int main(){
	cin>>N;
	rep1(i,N) d[i]=inf;
	d[1]=1;
	rep1(i,N) x[i]=__builtin_popcount(i);
	queue<int> que;
	que.push(1);
	while(!que.empty()){
		int a=que.front();
		que.pop();
		if(a+x[a]<=N&&d[a+x[a]]==inf){
			d[a+x[a]]=d[a]+1;
			que.push(a+x[a]);
		}
		if(a-x[a]>=0&&d[a-x[a]]==inf){
			d[a-x[a]]=d[a]+1;
			que.push(a-x[a]);
		}
	}
	if(d[N]==inf) d[N]=-1;
	cout<<d[N]<<endl;
}