import java.io.*;
import java.util.*;

public class Main {
    static Read scanner = new Read();
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

    public static void main(String[] args) throws IOException {
        int t = scanner.nextInt();
        while (t > 0) {
            int n = scanner.nextInt();
            int[] arr = new int[n + 1];
            arr[n] = -1;
            HashMap<Integer, Integer> first = new HashMap<>();
            HashMap<Integer, Integer> last = new HashMap<>();//记录元素最后一次出现的位置

            for (int i = 0; i < n; i++) {
                arr[i] = scanner.nextInt();
                last.put(arr[i], i);
            }
            for (int i = n - 1; i >= 0; i--) {
                first.put(arr[i], i);
            }
            Stack<Integer> stack = new Stack<>();
            int[] left = new int[n];
            int[] right = new int[n];
            //左边第一个比他大,需要下标

            for (int i = n - 1; i >= 0; i--) {
                while (!stack.isEmpty() && arr[i] > arr[stack.peek()]) {
                    left[stack.pop()] = i;
                }
                stack.push(i);
            }
            while (!stack.isEmpty()) {
                left[stack.pop()] = -1;
            }

            for (int i = 0; i < n; i++) {
                if (stack.isEmpty()) {
                    stack.push(i);
                } else {
                    while (!stack.isEmpty() && arr[i] > arr[stack.peek()]) {
                        right[stack.pop()] = i;
                    }
                    stack.push(i);
                }
            }
            while (!stack.isEmpty()) {
                right[stack.pop()] = n;
            }
            long ans = 0;

            //连续重复的特殊处理
            int pre = 0;
            for (int fast = 0; fast <= n; ) {
                if (arr[fast] == arr[pre]) {
                    fast++;
                    continue;
                } else {
                    //终于不相等了
                    //最左边是pre,最右边是fast - 1;
                    ans += pre - left[pre] - 1 + right[fast - 1] - (fast - 1) - 1;
                    pre = fast;
                }
            }

            out.println(ans);
            t--;
        }
        out.close();
    }
}

class Read {
    StringTokenizer st = new StringTokenizer("");
    BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));

    String next() throws IOException {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    String nextLine() throws IOException {
        return bf.readLine();
    }
}