#include #include using namespace std; //最大公約数 int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); } int main(int argc, char* argv[]) { int i,n1,n2; cin>>n1; int A,B; int A1; int sign1=0,sign2=0; cin>>A1; if (A1<0){ sign1++; A1=-A1; } int A2=1; for (i=2;i<=n1;i++){ cin>>A; if (A<0){ sign1++; A=-A; } A2*=A; } cin>>n2; int B1; cin>>B1; if (B1<0){ sign2++; B1=-B1; } int B2=1; for (i=2;i<=n2;i++){ cin>>B; if (B<0){ sign2++; B=-B; } B2*=B; } int A3=A1*B2; int B3=A2*B1; int C=gcd(A3,B3); if (sign1%2==1&&sign2%2==0){ A3=-A3; } if (sign1%2==0&&sign2%2==1){ B3=-B3; } cout<