#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P       = pair<int, int>;

template <class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    } else {
        return false;
    }
}
template <class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    } else {
        return false;
    }
}

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} SETUP;

template <typename T>
T gcd(T a, T b) {
    return b ? gcd(b, a % b) : a;
}
signed main() {
    int n;
    cin >> n;
    int nume = 1;
    int deno = 1;
    rep(i, 0, n) {
        int a;
        cin >> a;
        if (i == 0)
            nume *= a;
        else
            deno *= a;
    }
    cin >> n;
    rep(i, 0, n) {
        int a;
        cin >> a;
        if (i % 2 == 0)
            deno *= a;
        else
            nume *= a;
    }

    if (deno < 0 && nume < 0) {
        deno *= -1;
        nume *= -1;
    } else if (deno >= 0 && nume < 0) {
        deno *= -1;
        nume *= -1;
    }
    int g = gcd<int>(nume, deno);
    nume /= g;
    deno /= g;
    cout << nume << " " << deno << endl;
}