#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a % b);
}

int main() {
	int N1;
	cin >> N1;
	vector<int> A(N1);
	REP(i, N1) scanf("%d", &A[i]);
	int N2;
	cin >> N2;
	vector<int> B(N2);
	REP(i, N2) scanf("%d", &B[i]);
	ll ud = 1;
	FOR(i, 1, N1) ud *= A[i];
	ll du = B[N2 - 1], dd = 1;
	for (int i = N2 - 2; i >= 0; --i) {
		ll ndu = dd * B[i];
		ll ndd = du;
		du = ndu;
		dd = ndd;
	}
	ll u = A[0] * dd;
	ll d = ud * du;
	ll g = gcd(u, d);
	bool flag = u > 0 ^ d > 0;
	u = abs(u / g) * (flag ? -1 : 1);
	d = abs(d / g);
	cout << u << " " << d << endl;
}