#include<iostream>
#include<vector>
#include<bits/stdc++.h>

using namespace std;
int  maxn, num;
int sz[200005], inf = 1e9 + 1;
vector<int>g[200005];

void dfs(int id, int n)
{
    for (int i = 0; i < g[id].size(); i++)
    {
        num += n;
        //cout << num << "";
        dfs(g[id][i], n + 1);
    }
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int a;
        cin >> a;
        memset(g, 0, sizeof(g));
        maxn = 0;
        for (int i = 1; i <= a; i++)
        {
            cin >> sz[i];
            maxn = max(maxn, sz[i]);
        }
        sz[0] = inf, sz[a + 1] = inf;

        for (int i = 1; i <= a; i++)
        {

            int x1 = 0;
            int x2 = 0;
            for (int j = i; j >= 1; j--)
            {
                if (sz[j] > sz[i])
                {
                    x2 = sz[j];
                    break;
                }

            }
            for (int j = i; j <= a; j++)
            {
                if (sz[j] > sz[i])
                {
                    x1 = sz[j];
                    break;
                }
            }

            int minn;
            if (x2 == 0&&x1==0)
            {
                continue;
            }
            if (x2 == 0)
            {
                minn = x1;
            }
            if (x1 == 0)
            {
                minn = x2;
            }
            if (x1 != 0 && x2 != 0)
            {
                minn=min(x1, x2);
            }
            //cout << minn<<" ";
            g[minn].push_back(sz[i]);
        }
        num = 0;
        dfs(maxn, 1);
        cout << num << endl;
    }

}