#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

long long gcd(long long a, long long b){
  return b == 0LL ? a : gcd(b, a % b);
}

int main() {
	ll n1;
	cin>>n1;
	vector<ll> v1,v2;
	rep(i,0,n1){
		ll a;
		cin>>a;
		v1.pb(a);
	}
	ll n2;
	cin>>n2;
	rep(i,0,n2){
		ll a;
		cin>>a;
		v2.pb(a);
	}
	ll a = 1;
	ll b = 1;
	rep(i,0,v1.sz){
		if(i==0){
			a*=v1[i];
		}
		else{
			b*=v1[i];
		}
	}
	rep(i,0,v2.sz){
		if(i%2==1){
			a*=v2[i];
		}
		else{
			b*=v2[i];
		}
	}
	if(b<0){
		a*=-1;b*=-1;
	}
	ll d = gcd(abs(a),abs(b));
	cout << a/d << " " << b/d << endl;
	return 0;
}