#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
int gcd(int a, int b)
{
	int c;
	while (a != 0) {
		c = a; a = b%a;  b = c;
	}
	return b;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N1;
	cin >> N1;
	vector<int> A(N1);
	for (int i = 0; i < N1; i++) {
		cin >> A[i];
	}
	int N2;
	cin >> N2;
	vector<int> B(N2);
	for (int i = 0; i < N2; i++) {
		cin >> B[i];
	}
	int u = A[0];
	int d = 1;
	for (int i = 1; i < N1; i++)d *= A[i];
	for (int i = 0; i < N2; i++) {
		if (i % 2 == 0) {
			d *= B[i];
		}
		else {
			u *= B[i];
		}
	}
	int k = gcd(abs(u), abs(d));
	u /= k;
	d /= k;
	if ((u / abs(u)) *(d / abs(d)) == -1) {
		cout << "-";
	}
	cout << abs(u) << " " << abs(d) << endl;
}