#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

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


int main() {
	int minuscnt = 0;
	ll n1;
	cin >> n1;
	ll top = 1;
	ll bottom = 1;
	rep(i, 0, n1) {
		int a;
		cin >> a;
		if (a < 0) {
			minuscnt++;
			a = -a;
		}
		if (i)bottom *= a;
		else top *= a;
	}

	ll n2;
	cin >> n2;
	rep(i, 0, n2) {
		int b;
		cin >> b;
		if (b < 0) {
			minuscnt++;
			b = -b;
		}
		if (i % 2 == 0)bottom *= b;
		else top *= b;
	}

	if (minuscnt % 2 == 1)cout << "-";

	cout << top / gcd(top, bottom) << " " << bottom / gcd(top, bottom) << endl;

	
	return 0;
}