import std.stdio, std.string, std.conv; import std.range, std.algorithm, std.array, std.typecons, std.container; import std.math, std.numeric, core.bitop; enum mod = 10L^^9 + 7; void main() { int n; scan(n); auto a = readln.split.to!(int[]); int m; scan(m); auto b = readln.split.to!(int[]); int num = a[0], den = b[0]; foreach (i ; 1 .. n) { den *= a[i]; } foreach (i ; 1 .. m) { num *= b[i]; } if (sgn(den) == sgn(num)) { num = abs(num); den = abs(den); } else { num = -abs(num); den = abs(den); } int g = gcd(abs(num), den); writefln("%d %d", num / g, den / g); } int sgn(int x) { return x >= 0 ? 1 : -1; } void scan(T...)(ref T args) { import std.stdio : readln; import std.algorithm : splitter; import std.conv : to; import std.range.primitives; auto line = readln().splitter(); foreach (ref arg; args) { arg = line.front.to!(typeof(arg)); line.popFront(); } assert(line.empty); } void fillAll(R, T)(ref R arr, T value) { static if (is(typeof(arr[] = value))) { arr[] = value; } else { foreach (ref e; arr) { fillAll(e, value); } } }