#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define rep(i, n) for(int i=0;i<n;i++)
using ll = long long;

int main() {
    ll n; cin >> n;
    const ll N = 200001, M = 400001;
    ll ans = 0;
    vector<ll> B(N, 0);
    rep(i, n) {
        ll a, b;
        cin >> a >> b;
        ans = max(ans, min(b, B[a]));
        B[a] = max(B[a], b);
    }

    vector<pair<ll, ll>> v;
    for(ll i = 1; i < N; i ++) if(B[i]) v.push_back({i * B[i], i});

    sort(all(v));
    reverse(all(v));
    vector<ll> exist(M, 0);
    for(auto [Max, x] : v) {
        for(ll i = x; i < M; i += x) if(exist[i]) {
            ans = max(ans, Max / i);
            break;
        }
        for(ll i = x; i < M; i += x) exist[i] = 1;
    }
    cout << ans << endl;
    return 0; 
}