# include<bits/stdc++.h>
using namespace std;
int x,y,u,t,f,ans;
void dfs(int n,int k)
{
	if(f<=0) return;
	else{
		if((n+n)>=k) u=n+n-k;
		else u=k-(n+n);
		if(n+1>=k) t=n+1-k;
		else t=k-n-1;
		if(u>=t){
			ans++,n+=n;f=t;
		}
		else{
			ans++,++n;f=u;
		}
	}dfs(n,k);
}
int main()
{
    cin>>x>>y;
    f=max(x,y)-min(x,y);
    if(x!=y)
        dfs(x,y);
    else ans=0;
    cout<<ans;
    return 0;
}