#include<bits/stdc++.h>
using namespace std;
int dp[100010],i,n;
int main()
{
	cin>>n;
	dp[1]=0;dp[2]=1;
	for(i=3;i<=n;i++)
	{
		if(i%2==1)dp[i]=dp[i-1]+1;
		else dp[i]=min(dp[i-1],dp[i/2])+1;
	}
	cout<<dp[n];
	return 0;
}