import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

N1=int(readline())
A=list(map(int,readline().split()))
N2=int(readline())
B=list(map(int,readline().split()))
x,y=B[N2-1],1
for i in range(N2-2,-1,-1):
    x,y=y,x
    x*=B[i]
x,y=y,x
for i in range(1,N1):
    y*=A[i]
x*=A[0]
g=GCD(x,y)
if y<0:
    g*=-1
x//=g
y//=g
print(x,y)