#include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> pii;
const int N = 200010;
bool st[N];
int main(){
    int n, k;   cin >> n >> k;
    queue<pii> qu;
    qu.push({n, 0});
    st[n] = true;
    int res;
    while(!qu.empty()){
        pii now = qu.front();
        qu.pop();
        if(now.first == k){
            res = now.second; 
            break;
        }  
        if(now.first + 1 < N && !st[now.first + 1]){
            qu.push({now.first + 1, now.second + 1});
            st[now.first + 1] = true;
        }
        if(now.first - 1 >= 0 && !st[now.first - 1]){
            qu.push({now.first - 1, now.second + 1});
            st[now.first - 1] = true;
        }
        if(now.first * 2 < N && !st[now.first * 2]){
            qu.push({now.first * 2, now.second + 1});
            st[now.first * 2] = true;
        }
    }
    cout << res << endl;
    return 0;
}