P7616 [COCI 2011/2012 #2] ZADAĆA

Given $N$ positive integers $A_1, A_2, ..., A_N$ and $M$ positive integers $B_1, B_2, ..., B_M$, compute: $$\gcd(\prod\limits_{i=1}^N A_i, \prod\limits_{i=1}^M B_i)$$

The first line contains a positive integer $N$. The second line contains $N$ positive integers $A_i$. The third line contains a positive integer $M$. The fourth line contains $M$ positive integers $B_i$.

Output one line containing the answer. **If the answer has more than nine digits, you only need to output its last nine digits**.

#### Sample 1 Explanation $\gcd(30, 20) = 10$, so the answer is $10$. #### Constraints For $100\%$ of the testdata, $1 \le N, M \le 1000$, and $1 \le A_i, B_i \le 10^9$. #### Notes The scoring of this problem follows the original COCI problem settings, with a full score of $100$. This problem is translated from **[COCI2011-2012](https://hsin.hr/coci/archive/2011_2012/) [CONTEST #2](https://hsin.hr/coci/archive/2011_2012/contest2_tasks.pdf)** ___T3 ZADAĆA___。 Translated by ChatGPT 5