#include <iostream>
#include <vector>
using namespace std;
typedef long long LL;
//最大公約数
LL gcd(LL a, LL b)
{
    return b == 0 ? a : gcd(b, a % b);
}

int main(int argc, char* argv[])
{
	int i,n1,n2;
	cin>>n1;
	LL A,B;
	LL A1;
	int sign1=0,sign2=0;
	cin>>A1;
	if (A1<0){
		sign1++;
		A1=-A1;
	}
	LL A2=1;
	for (i=2;i<=n1;i++){
		cin>>A;
		if (A<0){
			sign1++;
			A=-A;
		}
		A2*=A;
	}
	cin>>n2;
	LL B1;
	cin>>B1;
	if (B1<0){
		sign2++;
		B1=-B1;
	}
	A2*=B1;
	LL B2=1;
	for (i=2;i<=n2;i++){
		cin>>B;
		if (B<0){
			sign2++;
			B=-B;
		}
		if (i%2==0){
			A1*=B;
		}else{
			A2*=B;
		}
	}
	LL C=gcd(A1,B2);
	if (sign1%2==1&&sign2%2==0){
		A2=-A2;
	}
	if (sign1%2==0&&sign2%2==1){
		A1=-A1;
	}
	cout<<A1/C<<" "<<A2/C<<endl;
	return 0;
}