#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
const int INF=1145141919,MOD=1e9+7;
const long long LINF=8931145141919364364,LMOD=998244353;
// const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};

long long gcd(long long x,long long y){
    if(x<y) swap(x,y); //常にx>=y
    //ユークリッドの互除法
    if(!(x%y)) return y;
    else return gcd(y,x%y);
}
int main(){
    long long up=1,down=1;
    int n; cin>>n;
    rep(i,n){
        long long a; cin>>a;
        if(i) down*=a;
        else up*=a;
    }
    cin>>n;
    rep(i,n){
        long long b; cin>>b;
        if(i%2) up*=b;
        else down*=b;
    }
    // cout<<up<<" "<<down<<endl;
    long long div=gcd(abs(up),abs(down));
    up/=div,down/=div;
    if(down<0) up*=-1,down*=-1;
    cout<<up<<" "<<down<<endl;
    return 0;
}