#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>

using namespace std;


int main() {
	int  i, j, k;
	long n, n2;
	vector<long>re;
	map<long, int>p1;


	cin >> n;
	n2 = n;
	int cnt = 0;

	while (true)
	{
		if (n == 1) break;

		if (n % 2 == 0) {
			n /= 2;
			re.push_back(n);
			cnt++;
		}
		else if (n % 2 == 1) {
			n++;
			cnt++;
			n /= 2;
			p1.insert(make_pair(n, 999));
			re.push_back(n);
			cnt++;
		}

		
	}
	
	/*
	for (i = re.size() - 1; i >= 0; i--) {

		if (re[i] == n * 2 && p1[n*2]==999) {
			n *= 2;
			n--;
		}
		else if (re[i] == n * 2) {
			n *= 2;
		}
	}
	cout << "n->"<< n << endl;
	*/


	cout << cnt << endl;







	getchar();
	getchar();
	return 0;
}