import java.io.*;
import java.math.*;
import java.sql.*;
import java.util.*;

public class Main
{
    static FastScanner sc = new FastScanner(System.in);// 快读
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));// 快速输出
    static StringTokenizer st;
    public static void main(String[] args)
    {
        //由此输入：
        int T = sc.nextInt();
        while (T-- > 0)
        {
            int n = sc.nextInt();
            int top;
            int sum = 0;
            Stack<Integer> stack = new Stack<>();

            int[] sz = new int[n + 10];
            int[] le = new int[n + 10];
            int[] re = new int[n + 10];

            for (int i = 1; i <= n; i++) {
                sz[i] = sc.nextInt();
            }

            for (int i = 1; i <= n; i++) {
                if (stack.isEmpty() || sz[i] < sz[stack.peek()]) stack.push(i);
                else {
                    while (!stack.isEmpty() && sz[stack.peek()] <= sz[i]) {
                        re[stack.peek()] = i;
                        stack.pop();
                    }
                    stack.push(i);
                }
            }

            while (!stack.isEmpty()) {
                re[stack.peek()] = n + 1;
                stack.pop();
            }

            for (int i = n; i >= 1; i--) {
                if (stack.isEmpty() || sz[i] < sz[stack.peek()]) stack.push(i);
                else {
                    while (!stack.isEmpty() && sz[stack.peek()] <= sz[i]) {
                        le[stack.peek()] = i;
                        stack.pop();
                    }
                    stack.push(i);
                }
            }

            while (!stack.isEmpty()) {
                le[stack.peek()] = 0;
                stack.pop();
            }
            for (int i = 1; i <= n; i++) {
                if (sz[le[i]] != sz[i]) sum += re[i] - le[i] - 1;
                else sum += re[i] - i;
            }
            out.println(sum - n);

        }
        out.flush();
        out.close();
    }
    static class FastScanner// 用于快速读入大量数据
    {
        static BufferedReader br;
        static StringTokenizer st;

        public FastScanner(InputStream in)
        {
            br = new BufferedReader(new InputStreamReader(in), 16384);
            eat("");
        }

        public static void eat(String s)
        {
            st = new StringTokenizer(s);
        }

        public static String nextLine()
        {
            try
            {
                return br.readLine();
            }
            catch (IOException e)
            {
                return null;
            }
        }

        public static boolean hasNext()
        {
            while (!st.hasMoreTokens())
            {
                String s = nextLine();
                if (s == null) return false;
                eat(s);
            }
            return true;
        }

        public static String next()
        {
            hasNext();
            return st.nextToken();
        }

        public static int nextInt()
        {
            return Integer.parseInt(next());
        }

        public static long nextLong()
        {
            return Long.parseLong(next());
        }

        public static double nextDouble()
        {
            return Double.parseDouble(next());
        }

        public BigInteger nextBigInteger()
        {
            return new BigInteger(next());
        }

        public BigDecimal nextBigDecimal()
        {
            return new BigDecimal(next());
        }
    }

    public static class SegmentTree
    {

        private int[] tree;
        private int[] arr;
        private int n;

        public SegmentTree(int[] arr)
        {
            this.arr = arr;
            n = arr.length;
            tree = new int[4 * n];
            build(1, 0, n - 1);
        }

        private void build(int node, int start, int end)
        {
            if (start == end) {
                tree[node] = arr[start];
                return;
            }
            int mid = (start + end) / 2;
            build(2 * node, start, mid);
            build(2 * node + 1, mid + 1, end);
            tree[node] = Math.max(tree[2 * node], tree[2 * node + 1]);
        }

        public int query(int start, int end) {
            return query(1, 0, n - 1, start, end);
        }

        private int query(int node, int start, int end, int l, int r) {
            if (l > end || r < start)
            {
                return 0;
            }
            if (l <= start && r >= end)
            {
                return tree[node];
            }
            int mid = (start + end) / 2;
            int leftSum = query(2 * node, start, mid, l, r);
            int rightSum = query(2 * node + 1, mid + 1, end, l, r);
            return Math.max(leftSum, rightSum);
        }

        public void update(int index, int value) {
            update(1, 0, n - 1, index, value);
        }

        private void update(int node, int start, int end, int index, int value) {
            if (index < start || index > end) {
                return;
            }
            if (start == end) {
                tree[node] = value;
                return;
            }
            int mid = (start + end) / 2;
            update(2 * node, start, mid, index, value);
            update(2 * node + 1, mid + 1, end, index, value);
            tree[node] = Math.max(tree[2 * node], tree[2 * node + 1]);
        }
    }
}