#include <cmath>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}
int main() {
	int n1, n2, x;
	long long a = 1, b = 1;
	cin >> n1;
	for (int i = 0; i < n1; ++i) {
		cin >> x;
		if (i == 0) a *= x;
		else b *= x;
	}
	cin >> n2;
	for (int i = 0; i < n2; ++i) {
		cin >> x;
		if (i & 1) a *= x;
		else b *= x;
	}
	if (b < 0) a *= -1, b *= -1;
	long long g = gcd(abs(a), abs(b));
	cout << a / g << ' ' << b / g << endl;
	return 0;
}