#include<iostream>
using namespace std;
struct{
	long point,t;
}line[200000];
bool bo[100100]={0};
long n,k,front,rear,mmin=10000000;
void push(long p,long t){
	if(p<=100100&&p>=0){
		if(!bo[p]&&t<mmin){
			bo[p]=true;
			line[rear].point=p;
			line[rear].t=t;
			//cout<<line[front].point<<' '<<p<<' '<<t<<endl;
			rear++;
		}
	}
}
int main()
{
	cin>>n>>k;
	front=0;rear=1;
	line[front].point=n;
	line[front].t=0;
	while(front!=rear){
		if(line[front].point==k){
			if(line[front].t<mmin)mmin=line[front].t;
		}
		else {
			push(line[front].point+1,line[front].t+1);
			push(line[front].point-1,line[front].t+1);
			push(line[front].point*2,line[front].t+1);
			bo[k]=false;
		}
		front++;
	}
	cout<<mmin;
}