Transmission System Minimum Finder

You are given an encoded transmission system where each test case consists of a sequence of numbers. Your task is to determine the smallest number in each sequence. For each test case, the first line contains an integer indicating the number of elements (which is not used in the computation) followed by a line containing the space‐separated integers of the transmission.

Formally, given a sequence \(a_1, a_2, \dots, a_n\), you are to compute \(\min\{a_1, a_2, \dots, a_n\}\).

Print the result for each test case on a separate line.

inputFormat

The input is read from stdin and structured as follows:

• The first line contains a single integer T, representing the number of test cases.
• For each test case:
• The first line contains an integer N (the number of elements in the sequence).
• The second line contains N space-separated integers.

outputFormat

For each test case, output the minimum integer in the sequence on a separate line to stdout.

## sample

3
5
3 1 4 1 5
4
10 20 30 40
6
-5 3 0 -2 4 1

1
10
-5

</p>