#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)

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

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;cin >> n;
	vector<ll> a(n);
	rep(i,n) cin >> a.at(i);
	int m;cin >> m;
	vector<ll> b(m);
	rep(i,m) cin >> b.at(i);
	int cnt=0;
	rep(i,n){
		if(a.at(i)<0){
			a.at(i)*=-1;
			cnt++;
		}
	}
	rep(i,m){
		if(b.at(i)<0){
			b.at(i)*=-1;
			cnt++;
		}
	}
	for(int i=2;i<n;++i){
		a.at(1)*=a.at(i);
	}
	for(int i=m-1;i>1;--i){
		b.at(i-2)*=b.at(i);
	}
	if(n>1 && m>1){
		ll g=gcd(a.at(0),b.at(0));
		a.at(0)/=g;
		b.at(0)/=g;
		g=gcd(a.at(1),b.at(1));
		a.at(1)/=g;
		b.at(1)/=g;
	}
	ll x=0,y=0;
	if(n==1 && m==1){
		x=a.at(0);
		y=b.at(0);
	}
	else if(n==1){
		x=a.at(0)*b.at(1);
		y=b.at(0);
	}
	else if(m==1){
		x=a.at(0)*b.at(0);
		y=a.at(1);
	}
	else{
		x=a.at(0)*b.at(1);
		y=a.at(1)*b.at(0);
	}
	ll g=gcd(x,y);
	if(cnt%2) x*=-1;
	cout << x/g << " " << y/g << endl;
}