#include <bits/stdc++.h>
typedef long long ll;
const int INF=1e9,MOD=1e9+7,ohara=1e6;
const ll LINF=1e18;
using namespace std;

#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl

ll n,cnt=0,ans=0,a[ohara],b[ohara],c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

long long gcd(long long aaa,long long bbb){
    if(bbb==0){
        return aaa;
    }
    return gcd(bbb,aaa%bbb);
}

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);
      
    cin>>n;
    //swap(bunbo,bunsi)して
    rep(i,n)cin>>a[i];
    rep(i,n){
        if(a[i]<0)cnt++,a[i]*=-1;
    }
    cin>>m;
    rep(i,m)cin>>b[i];
    rep(i,m){
        if(b[i]<0)cnt++,b[i]*=-1;
    }
    if(cnt%2==1)cnt=-1;
    else cnt=1;
    ll bunbo=1,bunsi=1;
    bunsi*=a[0];
    bunsi*=b[m-1];
    rrep(i,0,m-1)bunbo*=b[i];
    rrep(i,1,n)bunbo*=a[i];
    if(bunsi<0)cmp=bunsi*-1;
    else cmp=bunsi;
    if(bunbo<0)cmpp=bunbo*-1;
    else cmpp=bunbo;
    pos=gcd(cmp,cmpp);
    bunsi/=pos;bunbo/=pos;
    
    


    cout<<bunsi*cnt<<" "<<bunbo<<"\n";
    return 0;
}