CF1771C Hossam and Trainees

Hossam has $ n $ trainees. He assigned a number $ a_i $ for the $ i $ -th trainee. A pair of the $ i $ -th and $ j $ -th ( $ i \neq j $ ) trainees is called successful if there is an integer $ x $ ( $ x \geq 2 $ ), such that $ x $ divides $ a_i $ , and $ x $ divides $ a_j $ . Hossam wants to know if there is a successful pair of trainees. Hossam is very tired now, so he asks you for your help!

N/A

N/A

In the first example, the first trainee and the second trainee make up a successful pair: $ a_1 = 32, a_2 = 48 $ , you can choose $ x = 4 $ .