B'You are given an array a consisting of n integers a_1, a_2, ... , a_n . Your problem is to find such pair of indices i, j ( 1 <= i < j <= n ) that lcm(a_i, a_j) is minimum possible. lcm(x, y) is the least common multiple of x and y (minimum positive number such that both x and y are divisors of this number). The first line of the input contains one integer n ( 2 <= n <= 10^6 ) -- the number of elements in a . The second line of the input contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^7 ), where a_i is the i -th element of a . Print two integers i and j ( 1 <= i < j <= n ) such that the value of lcm(a_i, a_j) is minimum among all valid pairs i, j . If there are multiple answers, you can print any. '...