Alice wants to crack her boyfriend's phone's password but to do that she has to decrypt a code. She calls you up because she considers you as a good friend who is a very good coder from IIT Delhi (friend-zoned, sigh). You, trying to be nice to her, agree to help her.

While going through her boyfriend's stuff, she found an array. She also found a piece of paper which had written on it "Smallest two". Alice figured out that she needs to find the two numbers in the array with the minimum difference, but if there are many such pairs, the smaller number must be as small as possible. She guesses that the password must be one of these two numbers.

Your task is to find these two numbers.

Input

The first line of the input contains a single integer $T$, denoting the number of test cases. The description of each test case follows.

The first line of each test case consists of a single integer $N$. The second line consists of $N$ space separated integers denoting the integers in the array.

Output

For each test case, print the two numbers separated by a space (in ascending order) in a single line.

Constraints

$1\le T \le10$

$|A_i|\le10^{15}$

Subtask 1 (30 points): $2\le N \le10^3$

Subtask 2 (70 points): $2\le N \le10^5$

Problem Author: Kunal Gupta, Ankit Kumar Singh