#include <stdio.h>
#include <stdlib.h>

#define INF 1000000000000LL

int cmp_mul_rev (const void *a, const void *b) {
  long long *a_ = (long long *)a;
  long long *b_ = (long long *)b;
  
  if (a_[0]*a_[1] < b_[0]*b_[1]) {
    return 1;
  }
  
  if (a_[0]*a_[1] > b_[0]*b_[1]) {
    return -1;
  }
  
  return 0;
}

int main () {
  int n = 0;
  long long ab[200000][2] = {};
  
  int res = 0;
  
  long long ans = 0LL;
  long long min[200001] = {};
  
  res = scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    res = scanf("%lld", ab[i]);
    res = scanf("%lld", ab[i]+1);
  }
  
  qsort(ab, n, sizeof(long long)*2, cmp_mul_rev);
  
  for (int i = 0; i <= 200000; i++) {
    min[i] = INF;
  }
  
  for (int i = 0; i < n; i++) {
    long long mul = ab[i][0]*ab[i][1];
    for (long long p = 1LL; p*p <= ab[i][0]; p += 1LL) {
      if (ab[i][0]%p == 0LL) {
        if (mul/(min[(int)p]*ab[i][0]) > ans) {
          ans = mul/(min[(int)p]*ab[i][0]);
        }
        if (min[(int)p] > ab[i][0]/p) {
          min[(int)p] = ab[i][0]/p;
        }
        if (p*p != ab[i][0]) {
          if (mul/(min[(int)(ab[i][0]/p)]*ab[i][0]) > ans) {
            ans = mul/(min[(int)(ab[i][0]/p)]*ab[i][0]);
          }
          if (min[(int)(ab[i][0]/p)] > p) {
            min[(int)(ab[i][0]/p)] = p;
          }
        }
      }
    }
  }
  
  printf("%lld\n", ans);
  return 0;
}