CF1305C Kuroni and Impossible Calculation

To become the king of Codeforces, Kuroni has to solve the following problem. He is given $ n $ numbers $ a_1, a_2, \dots, a_n $ . Help Kuroni to calculate $ \prod_{1\le i

N/A

N/A

In the first sample, $ |8 - 5| = 3 \equiv 3 \bmod 10 $ . In the second sample, $ |1 - 4|\cdot|1 - 5|\cdot|4 - 5| = 3\cdot 4 \cdot 1 = 12 \equiv 0 \bmod 12 $ . In the third sample, $ |1 - 4|\cdot|1 - 9|\cdot|4 - 9| = 3 \cdot 8 \cdot 5 = 120 \equiv 1 \bmod 7 $ .