from sys import stdin
input = stdin.readline

class Eratosthenes:
    def __init__(self, n):
        self.isPrime = [True]*(n+1)
        self.minfactor = [-1]*(n+1)
        self.isPrime[0], self.isPrime[1] = False, False
        self.minfactor[1] = 1
        for i in range(2, n+1):
            if self.isPrime[i]:
                self.minfactor[i] = i
                for j in range(i*i, n+1, i):
                    self.isPrime[j] = False
                    if self.minfactor[j] == -1:
                        self.minfactor[j] = i
    
    def factorize(self, n):
        factor = []
        while n > 1:
            p = self.minfactor[n]
            cnt = 0
            while self.minfactor[n] == p:
                n //= p
                cnt += 1
            factor.append((p, cnt))
        return factor
    
    def divisor(self, n):
        ans = [1]
        pf = self.factorize(n)
        for p, c in pf:
            L = len(ans)
            for i in range(L):
                v = 1
                for _ in range(c):
                    v *= p
                    ans.append(ans[i]*v)
        return ans
    
E = Eratosthenes(10**5*2)

N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]

ans = 0
AB.sort()
NAB = []
for i in range(N):
    if i+1 < N:
        a, b = AB[i]
        c, d = AB[i+1]
        if a == c:
            ans = max(ans, b)
    if i+1 == N or AB[i][0] != AB[i+1][0]:
        NAB.append(AB[i][:])
AB = NAB

C = [[] for _ in range(10**5*2+1)]
for A, B in AB:
    for d in E.divisor(A):
        C[d].append((A, B))
for i in range(10**5*2+1):
    C[i].sort(key=lambda x:x[0]*x[1], reverse=True)
    if 2 <= len(C[i]):
        MIN = C[i][0][0]
        for j in range(1, len(C[i])):
            ans = max(ans, C[i][j][1]*i//MIN)
            MIN = min(MIN, C[i][j][0])

print(ans)