You are given an array [a_1, a_2, \ldots, a_n] of positive integers. You want to find some integer , for which the following conditions are satisfied:
appears in the array
There are no (with 1 \le i < j \le n), for which |a_i - a_j| = x
It can be proved that at least one such always exists under these conditions. If there are multiple such , you can output any of them.
The first line contains a single integer (1 \le t \le 10^4) — the number of test cases. The description of test cases follows.
The first line of each test case contains a single integer (2 \le n \le 2\cdot 10^5) — the length of the array.
The second line of each test case contains integers a_1, a_2, \ldots, a_n (1 \le a_i \le 10^9) — the elements of the array.
It is guaranteed that the sum of over all test cases does not exceed 2\cdot 10^5.
For each test case, output any integer , for which the conditions from the statement are satisfied. If there are multiple such , you can output any of them.
Example 1
In the first test case, is the only number present in the array, so we have to output it.
In the second test case, we can output any number among 1, 3, 5, 7, 9, as the difference of odd integers is always even.