#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
int n;
vector<int> vec;

int main(){
	cin >> n; int tmp = n;
	if(n == 1){cout << 0 << endl; return 0;}
	int a = 1, cou = 0, mi = INF;
	while(a < n) a *= 2, cou++;
	cou += a - n;
	mi = cou;

	int i = 0;
	while(!(tmp%2)){
		tmp /= 2; i++;
		int pos = 1, c = 0;
		while(pos < tmp) pos *= 2, c++;
		c += pos - tmp;
		mi = min(mi, c + i);
	}
	
	cout << mi << endl;
	return 0;
}