#include #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define repp(i, n) rep(i, n) #define reppp(i, n) repp(i, n) #define rrepp(i, n) rrep(i, n) #define repss(i, n) reps(i, n) #define repcc(i, n) repc(i, n) #define repii(i, a, b) repi(i, a, b) #define each(x, y) for (auto &x : y) #define all(a) (a).begin(), (a).end() #define bit(b) (1ll << (b)) using namespace std; using i32 = int; using i64 = long long; using u64 = unsigned long long; using f80 = long double; using vi32 = vector; using vi64 = vector; using vu64 = vector; using vf80 = vector; using vstr = vector; inline void yes() { cout << "Yes" << '\n'; exit(0); } inline void no() { cout << "No" << '\n'; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; } inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } template class pqasc : public priority_queue, greater> {}; template class pqdesc : public priority_queue, less> {}; template inline void amax(T &x, T y) { if (x < y) x = y; } template inline void amin(T &x, T y) { if (x > y) x = y; } template inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template istream& operator>>(istream &is, vector &v) { each(x, v) is >> x; return is; } template ostream& operator<<(ostream &os, vector &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } template istream& operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream& operator<<(ostream &os, pair &p) { os << p.first << ' ' << p.second; return os; } void solve() { int A; cin >> A; vi64 a(A); cin >> a; int B; cin >> B; vi64 b(B); cin >> b; i64 a1, a2; for (int i = 0; i + 3 <= A; i++) { a[i + 2] = a[i + 1] * a[i + 2]; a[i + 1] = a[i]; } if (A == 1) { a1 = 1, a2 = a[0]; } else if (A == 2) { a1 = a[0], a2 = a[1]; } else { a1 = a[A - 1], a2 = a[A - 2]; } reverse(all(b)); i64 b1, b2; for (int i = 0; i + 3 <= B; i++) { b[i + 2] = b[i + 2] * b[i]; } if (B == 1) { b1 = 1, b2 = b[0]; } else if (B == 2) { b1 = b[0], b2 = b[1]; } else { b1 = b[B - 2], b2 = b[B - 1]; } a2 *= b1, b2 *= a1; i64 m = gcd(abs(a2), abs(b2)); a2 /= m, b2 /= m; if (b2 < 0) b2 *= -1, a2 *= -1; cout << a2 << " " << b2 << '\n'; }