#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#include <cmath>
#include <functional>
#include <algorithm>
#include <utility>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <fstream>
#include <iomanip>
#include <time.h>
#include <complex>
//#pragma comment(linker, "/STACK:16777216")

using namespace std;

typedef long double C;
typedef complex<C> P;

#define X real()
#define Y imag()
#define Size(X) (int)X.size()
#define int long long
#define ui unsigned int
#define mp make_pair
#define timer fghge
#define y1 yjyjyju
#define all(X) (X).begin(), (X).end()
#define endl '\n'

int solve(int n) {
	if (n == 1) {
		return 0;
	}

	int cnt = 1e18, st, sf;

	for (int m = 1; m < 60; m++) {
		vector<int> stack;
		stack.push_back(1);
		int p = 1;
		for (int i = 0; i < m; i++) {
			stack.push_back(p);
			p *= 2;
		}

		for (int j = 0; j <= stack.size(); j++) {
			int cand = m;
			int sum = 0;
			for (int i = 0; i < j; i++)
				sum += stack[stack.size() - i - 1];
			int num = n - sum;

			if (num < 0)
				break;

			if (num == 0) {
				if (cand + 1 < cnt) {
					cnt = cand + 1;
					st = m;
				}
				continue;
			}

			vector<int> order;
			while (num > 0) {
				order.push_back(num % 2);
				num /= 2;
			}

			while (order.size() > m) {
				order[order.size() - 2] += order[order.size() - 1] * 2;
				order.pop_back();
			}

			int l = 1, r = 1e18, ans;
			while (l <= r) {
				bool flag = 1;
				int mid = (l + r) / 2;
				vector<int> cop = order;
				for (int i = cop.size() - 1; i >= 0; i--) {
					int delt = max(0LL, cop[i] - mid);
					if (i > 0)
						cop[i - 1] += 2 * delt;
					else if (delt > 0)
						flag = 0;
				}
				if (flag) {
					ans = mid;
					r = mid - 1;
				}
				else
					l = mid + 1;
			}

			int ctr = 0;
			for (int i = order.size() - 1; i >= 0; i--) {
				int delt = max(0LL, order[i] - ans);
				if (i > 0 && delt > 0) {
					order[i - 1] += 2 * delt;
					ctr++;
				}
			}

			cand += ans;

			bool flag = 0;
			int cntr = 0;
			for (int i = 0; i < order.size(); i++) {
				if (order[i] >= 1)
					flag = 1;
				else if (flag == 1) {
					flag = 0;
					cntr++;
				}
			}
			if (flag == 1)
				cntr++;

			cand += cntr - 1;

			if (cand + 1 < cnt) {
				cnt = cand + 1;
				sf = j;
				st = m;
			}
		}
	}

	/*vector<pair<int, int>> posl;

	int sum = (1LL << st);
	int num = n - sum;

	for (int i = 0; i < st; i++)
		posl.push_back({ 1, i + 1 });

	if (num > 0) {
		vector<int> order;
		while (num > 0) {
			order.push_back(num % 2);
			num /= 2;
		}
		while (order.size() > st) {
			order[order.size() - 2] += order[order.size() - 1] * 2;
			order.pop_back();
		}

		int l = 1, r = 1e18, ans;
		while (l <= r) {
			bool flag = 1;
			int mid = (l + r) / 2;
			vector<int> cop = order;
			for (int i = cop.size() - 1; i >= 0; i--) {
				int delt = max(0LL, cop[i] - mid);
				if (i > 0)
					cop[i - 1] += 2 * delt;
				else if (delt > 0)
					flag = 0;
			}
			if (flag) {
				ans = mid;
				r = mid - 1;
			}
			else
				l = mid + 1;
		}

		for (int i = order.size() - 1; i >= 0; i--) {
			int delt = max(0LL, order[i] - ans);
			if (i > 0 && delt > 0) {
				order[i] -= delt;
				order[i - 1] += 2 * delt;
			}
		}

		for (int i = 1; i <= ans; i++) {
			bool flag = 0; int ctr = 0, last;
			for (int j = 0; j < order.size(); j++) {
				if (order[j] >= i) {
					if (flag == 0)
						last = j;
					flag = 1;
				}
				else if (flag == 1) {
					posl.push_back({ last + 2, j + 1 });
					flag = 0;
				}
			}
			if (flag == 1)
				posl.push_back({ last + 2, order.size() + 1 });
		}
	}


	posl.push_back({ 1, posl.size() + 1 });
	cout << posl.size() << endl;

	for (auto &i : posl)
		cout << i.first << " " << i.second << endl;
		*/
	return cnt;
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	for (int i = 2; i <= 100; i++) {
		if (solve(i) != ceil(log2((double)i)) + 1) {
			cout << i << " " << solve(i);
			return 0;
		}
	}
	return 0;
}