#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	int n; cin >> n;
	vector<tuple<ll,ll,ll>> tar;
	rep(i,0,n){
		ll a, b; cin >> a >> b;
		tar.push_back(make_tuple(a * b, a, b));
	}
	
	sort(tar.begin(), tar.end());
	reverse(tar.begin(), tar.end());

	vector<ll> a(n), b(n);
	rep(i,0,n){
		a[i] = get<1>(tar[i]);
		b[i] = get<2>(tar[i]);
	}

	const int mx = 200000;
	vector<ll> see(mx + 1, 1e18);

	vector<vector<int>> d(mx + 1);
	rep(i,1,mx+1){
		for (int j=i; j<=mx; j+=i){
			d[j].push_back(i);
		}
	}

	ll ans = 0;
	rep(i,0,n){
		for (int j: d[a[i]]){
			// A[x] / j = GCD
			if (see[j] < 1e12){
				chmax(ans, (a[i] * b[i]) / (see[j] * a[i]));
			}
			chmin(see[j], a[i] / j);
		}
	}
	cout << ans << '\n';
}