import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
n = ni()
m = 2*10**5+2
a,b = zip(*[na() for _ in range(n)])

ans = -1
from math import gcd

def lcm(x, y):
    return (x * y) // gcd(x, y)

g = [[] for i in range(m)]
for i in range(n):
    g[a[i]].append(b[i])

for i in range(m):
    g[i] = sorted(g[i])
    if len(g[i]) >= 2:
        ans = max(ans, g[i][-2])

for d in range(1, m):
    f = []
    for j in range(d, m, d):
        if len(g[j]):
            f.append((j * g[j][-1], j, g[j][-1]))
    f.sort()
    #print(d, f)
    maxb = -10**18
    for i in range(len(f)):
        ans = max(ans, maxb * d // f[i][1])
        maxb = max(maxb, f[i][2])

print(ans)