#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;};

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

int main(void){
    cin>>n;
    rep(i,n)cin>>a[i];
    cin>>m;
    rep(i,m)cin>>b[i];
    double want,wantup,wantdo;
    wantup=(double)a[0];
    rrep(i,1,n){
        wantup=wantup/(double)a[i];
    }
    wantdo=(double)b[0];
    rrep(i,1,m){
        wantdo=wantdo/(double)b[i];
    }
    want=wantup/wantdo;
    /*
    printf("%.15f\n",wantup);
    printf("%.15f\n",wantdo);
    printf("%.15f\n",want);
    printf("%.15f\n",(double)5/72);
    */
    rrep(i,1,1000){
        rrep(j,1,1000){
            if(i==0||j==0)continue;
            double now=(double)i/j;
            //cout<<i<<" "<<j<<" "<<(double)i/j<<" "<<want<<"\n";
            if(now==want){
                cout<<i<<" "<<j<<"\n";
                return 0;
            }
            if(now*-1.0==want){
                cout<<i*-1.0<<" "<<j<<"\n";
                return 0;
            }
        }
    }

    return 0;
}