#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(),x.end()
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << p.first << " " << p.second; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#define ASSERT(...) 42
#endif
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int oo = 1e9;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n; cin >> n;
    const int A = 2e5+1;
    vector<ll> c(A);
    int ans=0;
    for(int i=0;i<n;++i) {
        int a,b; cin >> a >> b;
        ans=max(ans,min((int)c[a],b));
        c[a]=max((int)c[a],b);
    }
    for(int i=0;i<A;++i) c[i]*=i;
    
    for(int g=1;g<A;++g) {
        vi ord;
        for(int j=g;j<A;j+=g) {
            ord.push_back(j);
        }
        sort(all(ord),[&](int i, int j) {return c[i]>c[j];});
        ll best=oo;
        for(auto i : ord) {
            if(best!=oo) {
                ans=max(ans,(int) (c[i]/(i*best/g)));
            }
            best=min(best,(ll)i);
        }
        
    }
    cout << ans << '\n';
}