#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <stack>
#include <utility>

#define MAX 10000
#define INF 99999999

using namespace std;
typedef long long int lint;
typedef pair<int, int> Pii;
typedef pair<int, int> PII;

int bit(int N) {
	int ret = 0;
	for (int i = 1; i <= (1 << 16); i <<= 1) {
		ret += ((N & i) ? 1 : 0);
	}
	return ret;
}

int N;
int ans = INF;

vector<int> visited(MAX + 1, INF);

void rec(int i, int step)
{
	if (i <= 0 || i > N)
		return;
	if (i == N && step < ans) {
		ans = step;
		return;
	}
	else if (visited[i] < step)
		return;
	else
		visited[i] = step;
	
	rec(i + bit(i), step + 1);
	rec(i - bit(i), step + 1);
}

int main()
{
	cin >> N;
	rec(1, 1);
	cout << (ans != INF ? ans : -1) << endl;
}