#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n;
int dp[11234];

int main() {
	cin >> n;
	
	fill(dp, dp + n + 1, INF);
	
	queue<pii> que;
	que.push(pii(1, 1));
	
	while (!que.empty()) {
		int pos = que.front().first;
		int cost = que.front().second;
		
		que.pop();
		
		if (!chmin(dp[pos], cost)) continue;
		
		int d = 0;
		REP(i, 32) if (pos >> i & 1) d++;
		
		if (pos + d <= n) que.push(pii(pos + d, cost + 1));
		if (pos - d >= 1) que.push(pii(pos - d, cost + 1));
	}
	
	if (dp[n] == INF) puts("-1");
	else cout << dp[n] << endl;
	
	return 0;	
}