#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    
    ll asi=1,abo=1;
    ll bsi=1,bbo=1;
    {
        int n;cin>>n;
        vector<ll> a(n);
        rep(i,n){
            cin>>a[i];
        }
        asi=a[0];
        for(int i=1;i<n;i++) abo*=a[i];
    }
    {
        int n;cin>>n;
        vector<ll> b(n);
        rep(i,n){
            cin>>b[i];
        }
        rep(i,n){
            if(i%2==0){
                bsi*=b[i];
            }else{
                bbo*=b[i];
            }
        }
    }
    bool neg=false;
    ll si=asi*bbo,bo=abo*bsi;
    if((si>0 and bo>0) or (si<0 and bo<0));
    else neg=true;
    si=abs(si),bo=abs(bo);
    ll g=gcd(bo,si);
    si/=g;bo/=g;
    if(neg) si=-si;
    cout<<si<<" "<<bo<<endl;

    return 0;
}