// Arup Guha
// 6/6/2023
// Slow GCD

using namespace std;
#include <iostream>

int main() {

    int a, b, res = -1;
    cin >> a >> b;

    // Try each possible divisor in backwards order.
    for (int i=min(a,b); i>=1; i--) {
        if (a%i == 0 && b%i == 0) {
            res = i;
            break;
        }
    }

    // Ta da!
    cout << res << endl;
    return 0;
}