from functools import reduce
from operator import mul


def positive_gcd(*numbers: int) -> int:
    numbers = list(map(abs, numbers))
    if len(numbers) == 1:
        return numbers[0]
    if len(numbers) == 2:
        a, b = numbers
        if a < b:
            a, b = b, a

        while True:

            if a % b == 0:
                return b
            a, b = b, a % b

    first_gcd = positive_gcd(*numbers[:2])
    return positive_gcd(first_gcd, *numbers[2:])


def main():
    n1 = int(input())
    A = list(map(int, input().split()))
    n2 = int(input())
    B = list(map(int, input().split()))

    A_child = A[0]

    if n1 == 1:
        A_parent = 1
    else:
        A_parent = reduce(mul, A[1:])

    B_child = B[0]
    if n2 == 1:
        B_parent = 1
    else:
        B_parent = reduce(mul, B[1:])

    AB_child = A_child * B_parent
    AB_parent = A_parent * B_child

    gcd = positive_gcd(AB_child, AB_parent)
    AB_child //= gcd
    AB_parent //= gcd

    if AB_child * AB_parent < 0:
        print(-1 * abs(AB_child), abs(AB_parent))
    else:
        print(abs(AB_child), abs(AB_parent))


if __name__ == "__main__":
    main()