#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef bitset<16> BS;

const ll MOD = 1E+09 + 7;
const ll INF = 1E18;
const int MAX_N = 10;

int N1, N2;

ll A[MAX_N + 1], B[MAX_N + 1];

ll gcd(ll a, ll b);

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N1;
    bool sgn = true;
    for (int i = 1; i <= N1; i++) {
        cin >> A[i];
        if (A[i] < 0)
            sgn = !sgn;
    }
    cin >> N2;
    for (int i = 1; i <= N2; i++) {
        cin >> B[i];
        if (B[i] < 0)
            sgn = !sgn;
    }

    ll p_a = 1, p_b = 1;
    for (int i = 2; i <= N1; i++) {
        p_a *= A[i];
    }
    for (int i = 2; i <= N2; i++) {
        p_b *= B[i];
    }

    ll d = gcd(abs(A[1] * p_b), abs(B[1] * p_a));

    /*
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
        }
    }
    */
    ll a = abs(A[1] * p_b) / d;
    ll b = abs(B[1] * p_a) / d;
    if (!sgn)
        a *= -1;

    cout << a << " " << b << "\n";

    return 0;
}

ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;

    return gcd(b, a % b);
}