#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

void integerFactorization(long long n, vector<long long>& base, vector<int>& expo)
{
    base.clear();
    expo.clear();
    long long a = 2;
    while(a * a <= n){
        int b = 0;
        while(n % a == 0){
            ++ b;
            n /= a;
        }
        if(b > 0){
            base.push_back(a);
            expo.push_back(b);
        }
        ++ a;
    }
    if(n > 1){
        base.push_back(n);
        expo.push_back(1);
    }
}

int main()
{
    long long a, b;
    cin >> a >> b;

    vector<long long> base;
    vector<int> expo;
    map<long long, int> m;

    integerFactorization(a, base, expo);
    for(unsigned i=0; i<base.size(); ++i)
        m[base[i]] += expo[i];
    integerFactorization(b, base, expo);
    for(unsigned i=0; i<base.size(); ++i)
        m[base[i]] += expo[i];

    integerFactorization(a+b, base, expo);
    long long ans = 1;
    for(unsigned i=0; i<base.size(); ++i){
        int x = min(expo[i], m[base[i]]);
        while(--x >= 0)
            ans *= base[i];
    }
    cout << ans << endl;

    return 0;
}