#include<iostream>
using namespace std;
int n,arr[1000005],sum=0,minn=1e9;
void dfs(int d){
if(d>n||d<1){
return;
}
else if(d==n){
minn=min(minn,sum);
return ;
}
else{
sum++;
arr[d]=1;
dfs(d*2);
dfs(d+1);
dfs(d-1);
arr[d]=0;
}
}
int main(){
cin>>n;
dfs(1);
cout<<minn;
}
//you AK IOI!