#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
using namespace std;
typedef long long int ll;
const int INF = 100000000;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
int main(){
    ll a, b;
    cin >> a >> b;
    ll count = 0;
    if(a > b){
        count += 2000000000-a;
        count += a - b;
        count -= 1;
    }else{
        count += a-1;
        count += b-a;
        count -= 1;
    }
    cout << count << endl;
    return 0;
}