#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

vector<pll> primeFactorization(ll n) {
	vector<pll> res;
	
	for (ll i = 2; i * i <= n; i++) {
		if (n % i == 0) res.push_back(pll(i, 0));
		while (n % i == 0) {
			n /= i;
			res[res.size() - 1].second++;
		}
	}
	if (n > 1) res.push_back(pll(n, 1));
	
	return res;
}

int main() {
	ll a, b;
	cin >> a >> b;
	
	ll sum = a + b;
	
	vector<pll> v1 = primeFactorization(a), v2 = primeFactorization(b);
	
	ll ans = 1;
	REP(i, v1.size()) {
		REP(j, v1[i].second) {
			if (sum % v1[i].first == 0) {
				ans *= v1[i].first;
				sum /= v1[i].first;
			}
		}
	}
	
	REP(i, v2.size()) {
		REP(j, v2[i].second) {
			if (sum % v2[i].first == 0) {
				ans *= v2[i].first;
				sum /= v2[i].first;
			}
		}
	}
	
	cout << ans << endl;
	
	return 0;
}