//子序列：不连续
//子串：连续
#include <bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX

using namespace std;

const int N = 2e5 + 1000;
const int mod = 1e9 + 7;

int dx[4] = { -1,1,0,0 }, dy[4] = { 0,0,-1,1 };
struct edge
{
};

ll dp[32];

void solve()
{
    ll n;
    cin >> n;
    vector<ll> num(n + 1, 0), ans1(n + 1, 0), ans2(n + 1, 0);

    for (int i = 1;i <= n;i++) {
        cin >> num[i];
    }

    stack<ll> stk;

    for (int i = 1;i <= n;i++) {
        while (stk.size() && num[i] > num[stk.top()]) {
            ans1[i] += ans1[stk.top()] + 1;
            stk.pop();
        }
        stk.push(i);
    }

    while (stk.size())stk.pop();

    for (int i = n;i >= 1;i--) {
        while (stk.size() && num[i] > num[stk.top()]) {
            ans2[i] += ans2[stk.top()] + 1;
            stk.pop();
        }
        stk.push(i);
    }

    ll ans = 0;
    map<ll, ll> vis;
    for (int i = 1;i <= n;i++) {
        ans += ans1[i];
    }
    for (int i = n;i >= 1;i--) {
        if (!vis.count(num[i]))ans += ans2[i], vis[num[i]] = 1;
        else vis[num[i]] = 0;
    }
    cout << ans << '\n';


    // ll n;
    // cin >> n;

    // vector<ll> dp(n + 2, 0);
    // vector<vector<ll>> num(n + 1, vector<ll>(n + 1, 0));

    // for (int i = 1;i <= n;i++) {
    //     for (int j = 1;j <= i;j++) {
    //         cin >> num[i][j];
    //     }
    // }

    // for (int i = n;i >= 1;i--) {
    //     for (int j = 1;j <= i;j++) {
    //         dp[j] = max(dp[j], dp[j + 1]) + num[i][j];
    //     }
    // }
    // cout << dp[1] << '\n';
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    ll tc = 1;
    cin >> tc;
    while (tc--)solve();
    return 0;
}