#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> P;
typedef pair<int,pair<int,int>> PP;
typedef long long ll;

const double EPS = 1e-8;
const int INF = 1e9;
const int MOD = 1e9+7;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};

int main(void) {
	int N;cin >> N;
	vector<int> dp(N+1,INF);
	dp[1] = 0;

	for(int l=0;l<N;l++)
	for(int i=1;i<N+1;i++){
		int mv = __builtin_popcount(i);
		if(dp[i] != INF){
			if(i+mv <= N)dp[i+mv] = min(dp[i+mv],dp[i]+1);
			if(i-mv >= 1)dp[i-mv] = min(dp[i-mv],dp[i]+1);
		}
	}
	if(dp[N]+1 == INF)cout << -1 << endl;
	else cout << dp[N]+1 << endl;
	return 0;
}