#include <bits/stdc++.h>
using namespace std;

long long gcd(long long a, long long b){
  if(a < b){
    swap(a, b);
  }

  while(1){
    if(b == 0) return a;
    long long tmp = a % b;
    a = b;
    b = tmp;
  }
}



int main(){
  long long n1, n2;
  long long a;
  pair<long long, long long> bun1, bun2 , ans;

  cin >> n1 >> a;

  bun1.first = a;
  bun1.second = 1;

  for(long long i = 1;i < n1;i++){
    cin >> a;
    bun1.second *= a;
    long long tmp = gcd(bun1.first, bun1.second);
    bun1.first /= tmp;
    bun1.second /= tmp;
  }



  cin >> n2;

  long long b[20];
  for(long long i = 0;i < n2;i++){
    cin >> b[i];
  }

  bun2.first = b[n2-1];
  bun2.second = 1;

  for(long long i = n2-2;i >= 0;i--){
    long long x = bun2.first;
    long long y = bun2.second;

    bun2.first = b[i] * y;
    bun2.second = x;

    long long tmp = __gcd(bun2.first, bun2.second);
    bun2.first /= tmp;
    bun2.second /= tmp;
  }

  ans.first = bun1.first * bun2.second;
  ans.second = bun1.second * bun2.first;

  long long tmp = gcd(ans.first, ans.second);

  if(ans.second/tmp < 0){
    ans.first *= -1;
    ans.second *= -1;
  }

  cout << ans.first/tmp << " " << ans.second/tmp << endl;

  return 0;
}