#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>
#include<list>
#include<bitset>
#include<functional>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265358979

using namespace std;
typedef pair<int, int> P;

int main(void) {
	int n;
	int dp[10001] = {};
	queue<P>que;

	cin >> n;

	que.push(P(1,1));
	dp[1] = 1;
	if (n == 1) {
		cout << 1 << endl;
	}
	else {
		while (1) {
			int a, deep;
			int b;
			int flag = 0;
			a = que.front().first;
			deep = que.front().second;
			b = a;
			que.pop();
			while (1) {
				if (b % 2 == 1) {
					flag++;
				}
				b /= 2;
				if (b == 0) {
					break;
				}
			}
			if (a + flag == n) {
				cout << deep + 1 << endl;
				break;
			}
			if (a - flag > 0 && dp[a - flag] == 0) {
				que.push(P(a - flag, deep + 1));
				dp[a - flag] = 1;
			}
			if (a + flag < n&&dp[a + flag] == 0) {
				que.push(P(a + flag, deep + 1));
				dp[a + flag] = 1;
			}
			if (que.empty() == 1) {
				cout << -1 << endl;
				break;
			}
		}
	}
	


	
	return 0;
}