n = int(input())
a = [0] * n
b = [0] * n
for i in range(n):
    a[i], b[i] = map(int, input().split())

a_max = max(a)

res = 0

a_to_bmax = [-1] * (a_max + 1)
for i in range(n):
    if a_to_bmax[a[i]] == -1:
        a_to_bmax[a[i]] = b[i]
    else:
        res = max(res, min(a_to_bmax[a[i]], b[i]))
        a_to_bmax[a[i]] = max(a_to_bmax[a[i]], b[i])

for g in range(1, a_max // 2 + 1):
    ab_a_b = []
    for a in range(g, a_max + 1, g):
        b = a_to_bmax[a]
        if b == -1:
            continue
        ab_a_b.append([a * b, a, b])
    ab_a_b.sort()
    K = len(ab_a_b)

    a_min = [a_max + 1] * (K + 1)
    for k in range(K - 1, -1, -1):
        ab, a, b = ab_a_b[k]
        a_min[k] = min(a_min[k + 1], a)

    for k in range(K - 1):
        ab, a, b = ab_a_b[k]
        res = max(res, (b * g) // a_min[k + 1])

print(res)