**Problem Description**

One day, Bob came up with an strange idea. He wanted to know the number of mountain peaks in his paintings. As his best friend, he turned to you for help. You are given a list of N height sampling values Hi. You should determine how many peaks are there. For all i which satisfies 2 <= i <= N - 1, Hi is defined as a peak if and only if H

_{i-1}< Hi > H

_{i+1}.

**Input**

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains one integer N (1 <= N <= 50). The next line contains N integers Hi (1 <= Hi <= 8844). It is guaranteed that any two adjacent height sampling values will be different.

**Output**

For each test case, output the number of peaks.

**Sample Input**

2 9 1 3 2 4 6 3 2 3 1 5 1 2 3 4 5

**Sample Output**

3 0

**Source**

2014 ACM/ICPC 牡丹江赛区网络赛