#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
	int N;
	cin >> N;
	using P = pair<ll, ll>;
	std::vector<P> A(N);
	for (auto& [a, b] : A) cin >> a >> b;
	sort(A.begin(), A.end(), [](P a, P b) {return a.first * a.second < b.first * b.second;});
	vector<ll> Bs(200020, (ll)1e18);
	ll ans = 0;
	for (int i = N - 1; i >= 0; i --) {
		auto& [a, b] = A[i];
		ll mi = (ll)1e18;
		for (ll x = 1; x * x <= a; x ++) {
			if (a % x) continue;
			mi = min(mi, Bs[x]);
			ll d = a / x;
			Bs[x] = min(Bs[x], d);
			if (d > x) {
				mi = min(mi, Bs[d]);
				Bs[d] = min(Bs[d], x);
			}
		}
		ans = max(ans, b / mi);
	}
	cout << ans << endl;
}