B"You have n sticks of the given lengths. Your task is to choose exactly four of them in such a way that they can form a rectangle. No sticks can be cut to pieces, each side of the rectangle must be formed by a single stick. No stick can be chosen multiple times. It is guaranteed that it is always possible to choose such sticks. Let S be the area of the rectangle and P be the perimeter of the rectangle. The chosen rectangle should have the value frac{P^2}{S} minimal possible. The value is taken without any rounding. If there are multiple answers, print any of them. Each testcase contains several lists of sticks, for each of them you are required to solve the problem separately. The first line contains a single integer T ( T ge 1 ) -- the number of lists of sticks in the testcase. Then 2T lines follow -- lines (2i - 1) and 2i of them describe the i -th list. The first line of the pair contains a single integer n ( 4 <= n <= 10^6 ) -- the number of sticks in the i -th list. The second line of the pair contains n integers a_1, a_2, ... , a_n ( 1 <= a_j <= 10^4 ) -- lengths of the sticks in the i -th list. It is guaranteed that for each list there exists a way to choose four sticks so that they form a rectangle. The total number of sticks in all T lists doesn't exceed 10^6 in each testcase. Print T lines. The i -th line should contain the answer to the i -th list of the input. That is the lengths of the four sticks you choose from the i -th list, so that they form a rectangle and the value frac{P^2}{S} of this rectangle is minimal possible. You can print these four lengths in arbitrary order. If there are multiple answers, print any of them. There is only one way to choose four sticks in the first list, they form a rectangle with sides 2 and 7 , its area is 2 cdot 7 = 14 , perimeter is 2(2 + 7) = 18$"...