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

int main(){
    int N, M;
    cin >> N;
    vector<ll> A(N);
    for (ll& x : A) cin >> x;
    cin >> M;
    vector<ll> B(M);
    for (ll& x : B) cin >> x;

    ll U = A[0], D = 1;
    for (int i = 1; i < N; i++) {
        ll g = gcd(llabs(U), llabs(A[i]));
        U /= g;
        A[i] /= g;
        D *= A[i];
    }

    for (int i = 0; i < M; i++) {
        if (i%2 == 0){
            ll g = gcd(llabs(U), llabs(B[i]));
            U /= g;
            B[i] /= g;
            D *= B[i];
        }
        else{
            ll g = gcd(llabs(D), llabs(B[i]));
            D /= g;
            B[i] /= g;
            U *= B[i];
        }
    }

    if (D < 0)  U *= -1, D *= -1;
    cout << U << ' ' << D << '\n';
}