#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

map<ll,ll>mp;
ll rec(ll n){
    if(n==0)return mp[n]=0;
    if(n==1)return mp[n]=0;
    if(mp.find(n)!=mp.end()){
        return mp[n];
    }
    ll t = 1;
    for(ll i=0;i<40;i++){
        t*=2LL;
        if(t>=n)break;
    }
    if(n%2==1){
        if(n+1==t)return mp[n]=rec(n+1)+1;
        else{
            ll tmp1 = 1+rec(n+1);
            ll tmp2 = rec(t)+t-n;
            return mp[n]=min(tmp1,tmp2);
        }
    }
    else{
        ll x = n;
        ll cnt = 0;
        while(x%2==0){
            cnt++;
            x/=2;
        }
        if(x==1)return mp[n]=cnt+rec(x);
        else{
            ll tmp1 = cnt+rec(x);
            ll tmp2 = rec(t)+t-n;
            return mp[n]=min(tmp1,tmp2);
        }
    }
}

int main(void){
    ll n;
    cin>>n;
    cout<<rec(n)<<endl;
	return 0;
}