Problem Statement:
Rami has a new baby sister. He loves her very much and wants to give her his best toy to play with.

Rami has a lot of toys, every toy has a level of goodness represented by an integer ai . Rami is very lazy to do this by himself so he asked you to write a program to help him.


Input Format:
The first line of input has one integer T, which is the number of test cases. Next are T test cases.

Each test case has two lines. The first line has one integer N, which is the number of toys Rami has.

The next line has N integers a1, a2 ... an representing the goodness of each toy.

1 ≤ N ≤ 100,000

0 ≤ ai ≤ 109


Output Format:
For each test case output a single integer, representing the value of the best toy Rami has.


Sample Input:
2 5 1 3 7 1 6 7 2 2 2 9 3 1 3


Sample Output:
7 9


Notes:
Is the first test case Rami has 5 toys, their goodness is 1, 3, 7, 1, 6.

The best toy is the third toy with goodness equal to 7.





Added by: samiemad
Added at: 2014-07-26 09:00:10 UTC
Time Limit: 1 second
Partial score: No
Source:Practical C++ and Algorithms Course, Level 1, By. Sami EMAD