#include using namespace std; #define ll long long #define FOR(i,n,m) for(int i=(n);i<(m);i++) #define REP(i,n) FOR(i,0,n) #define REPR(i,n) for(int i=(n);i>=0;i--) #define all(vec) vec.begin(),vec.end() using vi=vector; using vvi=vector; using vl=vector; using vvl=vector; using P=pair; using PP=pair; using Pl=pair; using PPl=pair; using vs=vector; #define fi first #define se second #define pb push_back templatebool chmax(T &a,const T &b){if(abool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;} const ll MOD=1000000007LL; const int INF=1<<30; const ll LINF=1LL<<60; ll gcd(ll a,ll b){ return b==0?a:gcd(b,a%b); } ll lcm(ll a,ll b){ return a/gcd(a,b)*b; } ll extgcd(ll a,ll b,ll &x,ll &y){ if(!b){ x=1;y=0; return a; } ll d=extgcd(b,a%b,y,x); y-=a/b*x; return d; } struct Bunsu{ ll x,y; Bunsu():x(0),y(1){} Bunsu(ll x,ll y):x(x),y(y){ yakubun(); } bool operator<(Bunsu a){ return 1.0*x/y<1.0*a.x/a.y; } void yakubun(){ ll g=gcd(x,y); x/=g; y/=g; if(y<0){ x*=-1;y*=-1; } } Bunsu operator*=(ll t){ x*=t; yakubun(); return *this; } Bunsu operator/=(ll t){ y*=t; yakubun(); return *this; } Bunsu operator/=(Bunsu a){ x*=a.y; y*=a.x; yakubun(); return *this; } }; int main(){ int n; cin>>n; Bunsu ans(1,1); REP(i,n){ int x; cin>>x; if(i){ ans/=x; }else{ ans*=x; } } int m; cin>>m; REP(i,m){ int x; cin>>x; if(i){ ans*=x; }else{ ans/=x; } } cout<