#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int ans = 0;
  constexpr int M = 200001;
  VI d(M, -1);
  rep(i, n) {
    int a, b;
    cin >> a >> b;
    if (d[a] != -1) chmax(ans, min(b, d[a]));
    chmax(d[a], b);
  }
  vector<P> st;
  for (int g = 1; g < M; g++) {
    st.clear();
    for (int i = 1; g * i < M; i++) {
      if (d[i * g] == -1) continue;
      int bi = d[i * g];
      int l = 0, r = ssize(st);
      while (l < r) {
        int c = (l + r) / 2;
        auto [j, bj] = st[c];
        int v1 = bi / j, v2 = bj / i;
        if (v1 > v2) l = c + 1;
        else r = c;
      }
      for (int p : {l - 1, l}) if (0 <= p && p < ssize(st)) {
        auto [j, bj] = st[p];
        int v1 = bi / j, v2 = bj / i;
        chmax(ans, min(v1, v2));
      }
      if (st.empty() || st.back().second < bi) st.emplace_back(i, bi);
    }
  }
  cout << ans << '\n';
}