import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul, add from copy import deepcopy from string import ascii_lowercase, ascii_uppercase, digits from bisect import bisect, bisect_left from fractions import gcd, Fraction from heapq import heappush, heappop from functools import reduce def input(): return sys.stdin.readline().strip() def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(): return list(map(int, input().split())) def ZIP(n): return zip(*(MAP() for _ in range(n))) sys.setrecursionlimit(10 ** 9) INF = float('inf') mod = 10 ** 9 + 7 n1 = INT() A = deque(LIST()) Am = A.popleft() n2 = INT() B = LIST() B_up = reduce(mul, B[::2]) if n2 >= 2: B_down = reduce(mul, B[1::2]) B = deque([B_up, B_down]) else: B = deque([B_up]) Bm = B.popleft() while A or B: if A: A_tmp = A.pop() else: A_tmp = 1 if B: B_tmp = B.pop() else: B_tmp = 1 Am *= B_tmp Bm *= A_tmp g = gcd(Am, Bm) print(Am//g, Bm//g)