#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m;

int dfs(int t)
{
	if(t<=n)
		if(n-t<t*2-n+1)
			return n-t;
		else
			return t*2-n+1;
	if(t%2==1)
		return min(min(dfs(t+1)+1,dfs(t-1)+1),t-n);
	else
		return min(dfs(t/2)+1,t-n);
}

int main()
{
	while(cin>>n>>m)
	{
		if(n>m)
		{
			cout<<n-m<<endl;
			continue;
		}
		int t=m;
		int ans=0;
		if(n==0)//Õâ¶ÎºÜÖØÒª
		{
			n=1;
			ans=1;
		}
		ans+=dfs(t);
		cout<<ans<<endl;
	}
	return 0;
}