#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;


int main(int argc, char const *argv[])
{
	int n1; cin >> n1;
	vector<int> a(n1); {
		rep(i, n1) cin >> a[i];
	}
	int n2; cin >> n2;
	vector<int> b(n2); {
		rep(i, n2) cin >> b[i];
	}
	ll d1 = a[0], d2 = b[0];
	reps(i, 1, n1) d2 *= a[i];
	reps(i, 1, n2) d1 *= b[i];

	// printf("%lld %lld\n", d1, d2);
	for (ll i = 2; i * i <= 100000; ++i) {
		while(d1 % i == 0 && d2 % i == 0) {
			d1 /= i; d2 /= i;
		}
	}

	if (d1 % d2 == 0) {
		d1 /= d2; d2 = 1;
	}
	if (d2 % d1 == 0) {
		d2 /= d1; d1 = 1;
	}

	printf("%lld %lld\n", d1, d2);
	return 0;
}