#include <iostream>

#include <cstdio>

#include <cstring>

#include <queue>

using namespace std;

queue<int> q;

int vis[], arr[];

void go(int n, int k)

{

    q.push(n);

    vis[n] = ;

    int flag = ;

    while(!q.empty())

    {

        if(flag) break;

        int head = q.front(); q.pop();

        int direct[] = {, -, head};

        if(head == k) return;

        for(int i = ; i < ; i++)

        {

            int next = head + direct[i];

            if(next >=  && next <=  && !vis[next])//坐标一共有1e5但是可以移动到2x 所以next<=2e5；然后next可能小于0，vis[next]直接RE，所以把vis[next]放在最后，先判next>= 0

            {

                q.push(next);

                vis[next] = ;

                arr[next] = arr[head] + ;

            }

            if(next == k) flag = ;

        }

    }

    return;

}

int main()

{

    int n, k;

    while(scanf("%d %d", &n, &k) != EOF)

    {

        while(!q.empty()) q.pop();

        memset(vis, , sizeof(vis));

        memset(arr, , sizeof(arr));

        go(n, k);

        printf("%d\n", arr[k]);

    }

    return ;

}