from math import gcd

n = int(input())
a = list(map(int,input().split()))
m = int(input())
b = list(map(int,input().split()))

def prob(l):
    ret = 1
    for i in l:
        ret *= i
    return ret

p = a[0] * prob(b[1::2])
q = prob(a[1:]) * prob(b[::2])

g = gcd(p, q)

p //= g
q //= g

if q < 0:
    p, q = -p, -q

print(p, q)