# Discover the Peak's Apex

Easy

1

12.5% Acceptance

In a series of $N$ integers representing the elevation of peaks, identify the elevation of the highest peak.

### Input:

- The first line will have $T$, the total number of test cases. Following are the test cases.
- Each test case begins with a line containing a single integer, $N$.
- The next $N$ lines in each test case each present a single integer: the elevation of a peak.

### Output:

For every test case, print a single line containing one integer: the elevation of the highest peak in that test case.

### Constraints

- $1 \leq T \leq 10$
- $1 \leq N \leq 100000$
- $0 \leq$ elevation of each peak $\leq 10^9$

## Input Format

## Output Format

## Restrictions

## Example Test Cases (with explanation)

### Example #1:

Input:

`1 5 4 7 6 3 1`

Output:

```
7
```