#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <string>
#include <map>
#include <numeric>
using namespace std;
typedef long long int ll;

int dp[10001];

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n; cin >> n;
	for(int i=0;i<10001;i++){
		dp[i]=1e9;
	}
	dp[1]=1;
	queue<int> q;
	q.push(1);
	while(q.size()){
		int qq=q.front(); q.pop();
		int p=__builtin_popcount(qq);
		if(qq-p>=1&&dp[qq-p]>dp[qq]+1){
			dp[qq-p]=dp[qq]+1;
			q.push(qq-p);
		}
		if(qq+p<=n&&dp[qq+p]>dp[qq]+1){
			dp[qq+p]=dp[qq]+1;
			q.push(qq+p);
		}
	}
	if(dp[n]==1e9)dp[n]=-1;
	cout << dp[n] << endl;
}