#include <iostream>
#include <vector>
#include <queue>
#include <math.h>

int count(int);
std::vector<int> duplog;

int main(void) {
	struct pibot{
		int masu = 1;
		int step_count = 1;
	}pib;
	int N, beki, a, num_of_bit, masu;
	std::queue<pibot> pattern;

	//std::cin >> N;
	N = 11;
	pattern.push(pib);
	while (pattern.size() >= 1) {
		if (N == 1)
			break;
		pib = pattern.front();
		pattern.pop();
		std::cout << pib.masu << std::endl;
		//ビット数を求める
		for (int i = 0; pib.masu > 2 * i; i++) {
			beki = i;
		}
		//1を数える
		num_of_bit = 0;
		a = pib.masu;
		while (beki >= 0) {
			if (a >= (int)pow(2, beki)) {
				a -= (int)pow(2, beki);
				num_of_bit++;
			}
			beki--;
		}
		//マスを進むor戻る
		if (num_of_bit > 0) {
			int masu = pib.masu;
			int add = masu + num_of_bit;
			int sub = masu - num_of_bit;
			pib.step_count++;
			std::cout << "numofbit:" << num_of_bit << std::endl;
			if (add == N) {
				pib.masu += num_of_bit;
				break;
			}
			if (sub == N) {
				pib.masu -= num_of_bit;
				break;
			}
			if (count(masu) < 1) {
				duplog.push_back(masu);
				if (add < N) {
					pib.masu = add;
					pattern.push(pib);
				}
				if (sub > 0) {
					pib.masu = sub;
					pattern.push(pib);
				}
			}
		}
	}
	if (pib.masu == N) {
		std::cout << pib.step_count << std::endl;
	} else {
		std::cout << -1 << std::endl;
	}
	return 0;
}

int count(int x) {
	for (int i = 0; i < duplog.size(); i++) {
		if (x == duplog[i])
			return 1;
	}
	return 0;
}