#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;

const int maxn = 100005;

int posn,posk;
int t[maxn];

int bfs()
{
    memset(t,-1,sizeof(t));
    queue<int> que;
    que.push(posn);
    t[posn] = 0;


    int temp;
    while(que.size()){
        temp = que.front();
        que.pop();
        if(temp == posk){
            break;
        }

        int next;
        next = temp - 1;
        if(0 <= next && next <= maxn - 5 && t[next] == -1){
            que.push(next);
            t[next] = t[temp] + 1;
        }

        next = temp + 1;
        if(0 <= next && next <= maxn - 5 && t[next] == -1){
            que.push(next);
            t[next] = t[temp] + 1;
        }

        next = temp + temp;
        if(0 <= next && next <= maxn - 5 && t[next] == -1){
            que.push(next);
            t[next] = t[temp] + 1;
        }
    }
    return t[temp];
}

int main()
{
    while(scanf("%d %d",&posn,&posk) != EOF){
        printf("%d\n",bfs());
    }
    return 0;
}