#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr<<"!"<<" "<<(hoge)<<endl;
#define DBG cerr<<"!"<<endl;
#define BITLE(n) (1LL<<((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s,f,t) ((s).substr((f)-1,(t)-(f)+1))
#define ALL(a) (a).begin(),(a).end()
using namespace std;
vi prime;
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll n;cin>>n;
  prime.pb(2);
  for(ll i=3;i<=sqrt((ll)1e11);i+=2){
    bool fl=true;
    for(ll j=2;j<=sqrt(i);j++)
      if(i%j==0){
	fl=false;
	break;
      }
    if(fl)prime.pb(i);
  }
  ll sh=0,bo=1;
  for(int i=0;i<n;i++){
    ll a;cin>>a;
    if(i==0){
      sh=a;
    }else{
      bo*=a;
    }
  }
  cin>>n;
  ll sh2=0,bo2=1;
  for(int i=0;i<n;i++){
    ll a;cin>>a;
    if(i==0)sh2=a;
    else bo2*=a;
  }
  sh*=bo2;
  bo*=sh2;
  for(int i=0;i<prime.size();i++){
    while(sh%prime[i]==0&&bo%prime[i]==0){
      sh/=prime[i];
      bo/=prime[i];
    }
  }
  if(bo>0){
    cout<<sh<<" "<<bo<<endl;
  }else{
    cout<<-sh<<" "<<-bo<<endl;
  }
  return 0;
}