#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************





int consistency(int n){

	vector<int> dp(n+1);
	
	dp[1] = 0;
	
	for(int i=2; i<=n; i++){
		if(i & 1){
			dp[i] = min(1 + dp[i-1] , 2 + dp[(i+1)/2] );
		}
		else{
			dp[i] = 1 + dp[i/2];
		}
	}
	
	return dp[n];


}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}