#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
void SOLVE(){
  int n;
  cin>>n;
  vector<P>a(n);
  cin>>a;
  ll ans=0;
  map<int,ll>mx;
  int b=0;
  rep(i,n){
    if(mx.contains(a[i].first)){
      chmax(ans,min(a[i].second,mx[a[i].first]));
      chmax(mx[a[i].first],a[i].second);
    }
    else mx[a[i].first]=a[i].second;
    chmax<int>(b,a[i].first);
  }
  vector<ll>c(b+1,-1);
  for(auto [k,v]:mx)c[k]=v;
  for(int i=b;i>=1;i--){
    vector<P>d;
    for(int j=1;i*j<=b;j++)if(c[i*j]!=-1)d.emplace_back(i*j,c[i*j]);
    if(d.size()<=1)continue;
    sort(all(d),[](P x,P y){return x.first*x.second<y.first*y.second;});
    ll now=1e9+10;
    for(int j=d.size()-1;j>=0;j--){
      chmax(ans,d[j].second*i/now);
      chmin(now,d[j].first);
    }
  }
  // rep(i,n-1)reps(j,i+1,n){
  //   ll g=gcd(a[i].first,a[j].first);
  //   chmax(ans,min(a[i].second*g/a[j].first,a[j].second*g/a[i].first));
  // }
  cout<<ans<<endl;
}