#### 488. Dales and Hills

Time limit per test: 0.5 second(s)
Memory limit: 262144 kilobytes
input: standard
output: standard

Let's consider a number sequence a 1, ·s, a N. We call the continuous subsequence a i, ·s, a j, ·s, a k (1 ≤ i < j < kN) of the sequence a if a t < a t+1 for any it < j and a t > a t+1 for any jt < k. In this case we call the of the hill. Similarly, we call the continuous subsequence a if a t > a t+1 for any it < j and a t < a t+1 for any jt < k. In this case we call the of the dale.

Compute the height of the highest hill and the depth of the deepest dale in the given sequence.

Input
The first line of the input file contains T (), the number of test cases. The test cases follow, occupying two lines each. The first of the two lines contains N (), the second the members of the sequence, separated by spaces. The sum of values of N over all test cases in the file does not exceed . The absolute values of the members of the sequences do not exceed .

Output
The output file should consist of T lines and each line should contain two integers, the height of the highest hill and the depth of the deepest dale. If there are no hills or no dales, output 0 in the corresponding position.

Example(s)
 sample input sample output 2 10 4 4 1 6 3 2 1 2 5 7 10 2 3 4 5 6 7 8 9 10 9  1 3 1 0