#include<bits/stdc++.h>
using namespace std;
int n,best;
int dfs(int n,int ans)
{
    if(n==1)
    {
       best=min(best,ans);
       return 0;
    }
    else
    {
        if(n&1)
        {
            dfs(n+1,ans+1);
            dfs(n-1,ans+1); 
        }
        else
            dfs(n/2,ans+1);
    }
}
int main(){
    freopen("mico.in","r",stdin);
    freopen("mico.out","w",stdout);
    while(cin>>n)
    {
        if(n==0)break;
        best=100;
        dfs(n,0);
        printf("%d\n",best);
    }
    return 0;
}