#include <bits/stdc++.h>
using namespace std;

vector<int> a;
vector<bool> b;
vector<int> c;

int bitsum(int n){
	int ans=0;
	while(n>0){
		if(n&1) ans++;
		n>>=1;
	}
	return ans;
}

int main(){
	int n;cin >> n;
	a.resize(n+1);
	b.resize(n+1,false);
	c.resize(n+1,100000000);
	for(int i=1;i<=n;++i){
		a.at(i)=bitsum(i);
	}
	queue<int> q;
	q.push(1);
	c.at(1)=1;
	while(!q.empty()){
		int np=q.front();
		q.pop();
		if(b.at(np)) continue;
		b.at(np)=true;
		if(0<np-a.at(np) && np-a.at(np)<=n && !b.at(np-a.at(np))){
			c.at(np-a.at(np))=min(c.at(np)+1,c.at(np-a.at(np)));
			q.push(np-a.at(np));
		}
		if(0<np+a.at(np) && np+a.at(np)<=n && !b.at(np+a.at(np))){
			c.at(np+a.at(np))=min(c.at(np)+1,c.at(np+a.at(np)));
			q.push(np+a.at(np));
		}
	}
	if(b.at(n)) cout << c.at(n) << endl;
	else cout << -1 << endl;
}