#include <iostream>
using namespace std;

long long gcd(long long a, long long b) {
    return !b ? a : gcd(b, a % b);
}

int main() {
    long long a, b;
    const long long MAX_D = 1000;
    long long best = -1;
    
    cin >> a >> b;
    
    for (int i = a; i <= a + MAX_D && i <= b; ++i) {
        for (int j = b; j >= b - MAX_D && j >= a && j >= i && j - i + 1 >= best; --j)
            if (gcd(i, j) == 1 && j - i + 1 > best) {
                best = j - i + 1;
            }
    }
    
    cout << best << "\n";
}