Sky and Pink

Shihyun found $N$ pink hair strands and $N$ sky-blue hair strands lying in a corner of his room!

Shihyun was sure that all of them belonged to Danbi.

Shihyun measured the strands. The length of the $i$-th pink strand was $A_i$, and the length of the $i$-th sky-blue strand was $B_i$. $(1 \leq i \leq N)$

After measuring every strand, Shihyun wondered which nonzero integers $a$ and $b$, each between $-1\,000\,000$ and $1\,000\,000$ inclusive, minimize $\left| a\sum_{i=1}^N A_i - b\sum_{i=1}^N B_i \right|$.

Answer his question!

The first line contains the number of hair pairs $N$. $(1 \leq N \leq 1\,000)$

The second line contains $A_1, A_2, \cdots, A_N$, and the third line contains $B_1, B_2, \cdots, B_N$, separated by spaces. $(1 \leq A_i, B_i \leq 100)$

All numbers in the input are integers.

On the first line, print $a$ and $b$ that minimize $\left| a\sum_{i=1}^N A_i - b\sum_{i=1}^N B_i \right|$, separated by a space.

If there are several such pairs $(a, b)$, print any of them.