#include <iostream>
#include <bitset>
#include <fstream>
#include <string>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <cctype>
#include <list>
#include <limits>
//#include <boost/multiprecision/cpp_int.hpp>

const double EPS = (1e-10);


using namespace std;
using Int = long long;
//using namespace boost::multiprecision;

const Int MOD = 1000000007;

Int mod_pow(Int x, Int n) {
    Int res = 1;
    while(n > 0) {
        if(n & 1) res = (res * x) % MOD; //ビット演算(最下位ビットが1のとき)
        x = (x * x) % MOD;
        n >>= 1; //右シフト(n = n >> 1)
    }
    return res;
}

template<typename T>
T gcd(T a, T b) {
    return b != 0 ? gcd(b, a % b) : a;
}

template<typename T>
T lcm(T a, T b) {
    return a * b / gcd(a, b);
}

Int a[15];
Int b[15];

int main(){
    cin.tie(0);
    
    int n; cin >> n;
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    int n2; cin >> n2;
    for (int i = 0; i < n2; i++){
        cin >> b[i];
    }
    
    for (int i = n2-1; i > 0; i--){
        a[0] *= b[i];
    }
    for (int i = n-1; i > 0; i--){
        b[0] *= a[i];
    }

    if (b[0] < -1){
        b[0] *= -1;
        a[0] *= -1;
    }
    Int GCD = gcd(a[0], b[0]);
    cout << a[0]/GCD << " " << b[0]/GCD << endl;

}