#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 21, INF = 0x3f3f3f3f;
ll ans;

struct node
{
    ll idx, val, fa, mul, son[2];
    friend bool operator<(node a, node b) { return a.idx < b.idx; }
    void init(ll _idx, ll _val, ll _fa, ll _mul)
    {
        idx = _idx, val = _val, fa = _fa, mul = _mul, son[0] = son[1] = 0;
    }
} tree[N];

ll build(ll n)
{
    for (int i = 1; i <= n; i++)
    {
        ll k = i - 1;
        while (tree[k].val < tree[i].val)
            k = tree[k].fa;
        tree[i].son[0] = tree[k].son[1];
        tree[k].son[1] = i;
        tree[i].fa = k;
        tree[tree[i].son[0]].fa = i;
    }
    return tree[0].son[1];
}

void dfs(ll x, ll d)
{
    if (!x)
        return;
    ans += d * tree[x].mul;
    dfs(tree[x].son[0], d + 1);
    dfs(tree[x].son[1], d + 1);
    return;
}

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        ll n, h, rt;
        ans = 0;
        cin >> n;
        tree[0].init(0, INF, 0, 0);
        for (int i = 1; i <= n; i++)
        {
            cin >> h;
            if (h == tree[i - 1].val)
                tree[i - 1].mul++, i--, n--;
            else
                tree[i].init(i, h, 0, 1);
        }
        rt = build(n);
        dfs(rt, 0);
        cout << ans << '\n';
    }
    return 0;
}