#include<iostream>
#include<cstdio>
using namespace std;
int que[110000];
int num[110000];
int dn[3]={-1,1,2};
int main()
{
int n,m,i,j,x;
scanf("%d%d",&m,&n);
int head=0,tail=1;
que[1]=m;
num[m]=0;
int flag=0;
while(head<tail)
{
head++;
for(i=0;i<=2;i++)
{
if(i==0||i==1)
x=que[head]+dn[i];
else x=que[head]*dn[i];
if(x>=0&&x<=100000&&x!=m&&num[x]==0)
{
tail++;
que[tail]=x;
num[x]=num[que[head]]+1;
if(x==n)
{
flag=1;
cout<<num[n]<<endl;
head=tail+1000;
}
}
}
}
return 0;
}