#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/

int euc(int a, int b) {
	if (a < b) return euc(b, a);
	int r;
	while ((r = a % b)) {
		a = b;
		b = r;
	}
	return b;
}

int main() {
	int n1;
	cin >> n1;
	vector<int>vec1(n1);
	for (int i = 0; i < n1; i++) {
		cin >> vec1[i];
	}
	int n2;
	cin >> n2;
	vector<int>vec2(n2);
	for (int i = 0; i < n2; i++) {
		cin >> vec2[i];
	}
	int a, b, c, d;
	a = 1;
	b = 1;
	c = 1;
	d = 1;
	a = vec1[0];
	for (int i = 1; i < n1; i++) {
		b *= vec1[i];
	}
	for (int i = 0; i < n2; i++) {
		if (i % 2 == 0) {
			c *= vec2[i];
		}
		else {
			d *= vec2[i];
		}
	}
	int A = a * d;
	int B = b * c;
	int C = euc(abs(A), abs(B));
	int ansa = A / C;
	int ansb = B / C;
	if (ansb < 0) {
		ansb *= (-1);
		ansa *= (-1);
	}
	cout << ansa << ' ' << ansb << endl;
}