#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;

int n,m;
int d[20000];

int main() {
	scanf("%d %d",&n,&m);
	memset(d,-1,sizeof(d));
	queue<int> q;
	d[n]=0;
	q.push(n);
	while (!q.empty()) {
		int x=q.front(), y;
		q.pop();
		y=x-1;
		if (0<y && d[y]==-1) {
			d[y]=d[x]+1;
			q.push(y);
		}
		y=x*2;
		if (y<20000 && d[y]==-1) {
			d[y]=d[x]+1;
			q.push(y);
		}
	}
	printf("%d\n",d[m]);
	return 0;
}