#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;
const int N = 200001, M = 400001;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, ans = 0;
    cin >> n;
    vector<int> B(N, 0);
    rep(i, n) {
        int a, b;
        cin >> a >> b;
        ans = max(ans, min(b, B[a]));
        B[a] = max(B[a], b);
    }

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

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