Maximum Average Difficulty

Alice is given a set of problems, each with a certain difficulty level. She can choose any subsequence of these problems, and her goal is to achieve the maximum possible average difficulty. It turns out that the optimal strategy is to pick the problem with the highest difficulty. Your task is to determine this optimal average difficulty value.

In other words, given a list of integers representing the difficulty levels, output the maximum value formatted to two decimal places.

Note: Although the problem mentions an 'average', the maximum average achievable by any subsequence is simply the maximum element (since including any additional, lower value can only decrease the overall average).

inputFormat

The input is read from standard input (stdin). The first line contains a single integer T, representing the number of test cases. Each test case consists of two lines:

1. The first line contains an integer n, the number of problems.
2. The second line contains n space-separated integers representing the difficulty levels of the problems.

outputFormat

For each test case, output a single line on standard output (stdout) containing the maximum possible average difficulty (which is the maximum difficulty in the list), formatted to two decimal places.## sample

1
1
4

4.00