Minimum Possible Maximum Element

You are given one or multiple arrays. For each array, you are allowed to perform an arbitrary number of operations (or "tricks") intended to reduce the largest element of the array. After analyzing the problem, you will notice that no matter how many operations you perform, the smallest possible value of the maximum element in the array is simply the minimum element of the array.

Your task is to compute this value for each input array.

Note: The trick operations are abstract; you only need to output the minimum element for each test case.

Mathematically, if \(a_1,a_2,\dots,a_N\) are the elements of the array, then the answer is \(\min\{a_1,a_2,\dots,a_N\}\).

inputFormat

The input is given via standard input (stdin). The first line contains an integer \(T\) representing the number of test cases. For each test case, the first line contains an integer \(N\) — the size of the array. The second line contains \(N\) space-separated integers representing the elements of the array.

For example:

1
5
3 1 4 1 5

outputFormat

For each test case, output a single line containing one integer — the minimum element in the array, which is the minimum possible maximum element after applying any number of operations.

## sample

1
5
3 1 4 1 5

1

</p>