Milly is playing with an array A of size N. She is trying to find those non-empty subarrays (sequence of consecutive elements) whose maximum and minimum values are identical. Milly got confused while counting. Your task is to help her in this problem.

Input

• First line of the input will contain T denoting the number of test-cases.
• For every test case, first line will contain N. Next line will contain N space separated integers denoting A_i.

Output

• For every test case, print the required answer in a separate line.

Constraints

• 1 ≤ T ≤ 10
• 1 ≤ N ≤ 10⁵
• 1 ≤ |A_i| ≤ 10⁹
Here, || denotes the absolute value.