#include <iostream>
#include <algorithm>
#include <limits>

using namespace std;

int bits[10001];
int minCounts[10001];

int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		bits[i] = 0;
		for (int k = i; k > 0; k >>= 1) {
			if (k & 0x1) {
				++bits[i];
			}
		}
	}
	fill(&minCounts[0], &minCounts[n] + 1, numeric_limits<int>::max());
	minCounts[1] = 1;
	for (int repeat = 0; repeat < n; ++repeat) {
		for (int i = 1; i <= n; ++i) {
			if (minCounts[i] != numeric_limits<int>::max()) {
				if (i + bits[i] <= n) {
					minCounts[i + bits[i]] = min(minCounts[i + bits[i]], minCounts[i] + 1);
				}
				if (i - bits[i] >= 1) {
					minCounts[i - bits[i]] = min(minCounts[i - bits[i]], minCounts[i] + 1);
				}
			}
		}
	}
	cout << ((minCounts[n] == numeric_limits<int>::max()) ? -1 : minCounts[n]) << endl;
	return 0;
}