import math
import sys

def compute_M(factors, p):
    M = 1
    for prime, exp in factors.items():
        if prime != p:
            M *= prime ** exp
    return M

def main():
    input = sys.stdin.read().split()
    idx = 0
    k = int(input[idx])
    idx += 1
    factors = {}
    for _ in range(k):
        p = int(input[idx])
        e = int(input[idx+1])
        factors[p] = e
        idx += 2

    candidates = [p for p in factors if factors[p] == 1]

    for p in candidates:
        try:
            M = compute_M(factors, p)
        except:
            continue
        max_r = min(10**5, p)
        for r in range(1, max_r + 1):
            k_val = r - 1
            if k_val > p - 1:
                break
            numerator = 1
            for i in range(k_val):
                term = p - 1 - i
                numerator *= term
            denominator = math.factorial(k_val)
            try:
                C = numerator // denominator
            except:
                continue
            if C == M * r:
                print(p, r)
                return
    print(-1, -1)

if __name__ == '__main__':
    main()