#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;


ll gcd(ll n, ll m) {
    if (n < m) swap(n, m);
    while (m != 0) {
        ll r = n % m;
        n = m;
        m = r;
    }
    return n;
}

int main() {
    ll p[2] = { 1, 1 };

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        p[i != 0] *= a;
    }

    int m;
    cin >> m;
    for (int i = 0; i < m; i++) {
        int b;
        cin >> b;
        p[i % 2 == 0] *= b;
    }

    if (p[0] == 0) {
        cout << "0 1" << endl;
    } else {
        if (p[1] < 0) p[0] *= -1, p[1] *= -1;
        if (p[0] < 0) {
            cout << '-';
            p[0] *= -1;
        }
        ll t = gcd(p[0], p[1]);
        p[0] /= t;
        p[1] /= t;
        cout << p[0] << ' ' << p[1] << endl;
    }

    return 0;
}