#include<bits/stdc++.h>

#define i64 long long
#define ll long long

using namespace std;

typedef pair<i64, i64> pii;

const i64 MOD = 998244353;

inline i64 lowbit(i64 x) { return x & (-x); }

inline i64 highbit(i64 x) {
    i64 cnt = 0;
    do {
        if (x == 1) return 1LL << cnt;
        else ++cnt;
    } while (x >>= 1);
}

inline i64 factory(i64 x) {
    i64 cnt = 1;
    while (x != 1) {
        cnt *= x--;
        cnt %= MOD;
    }
    return cnt;
}//阶乘（含模运算）

inline i64 gcd(i64 a, i64 b) {
    while (b ^= a ^= b ^= a %= b);
    return a;
}//最小公约数

inline bool isPrime(i64 x) {
    for (int i = 2; i <= sqrt(x); ++i) {
        if (x % i == 0) return false;
    }
    if (x != 1) return true;
    else return false;
}

inline bool cmp(pii a, pii b) {
    return a.first > b.first;
}

inline i64 query(i64 a, i64 b) {
    i64 tmp;
    cout << "? " << a << " " << b << endl;
    cout.flush();
    cin >> tmp;
    return tmp;
}

inline i64 to_i64(string s) {
    stringstream ss(s);
    i64 tmp;
    ss >> tmp;
    return tmp;
}//字符串转long long

inline i64 LIS(i64 arr[], i64 n) {
    i64 dp[n], len = 0;
    dp[0] = arr[0];
    for (int i = 1; i < n; ++i) {
        if (arr[i] > dp[len]) dp[++len] = arr[i];
        else *(lower_bound(dp, dp + len, arr[i])) = arr[i];
    }
    return len + 1;
}

struct st {
    i64 num;
    i64 idx;
};

bool cmpp(st a, st b) {
    return a.num > b.num;
}

void solve() {
    i64 n;
    cin >> n;
    i64 a[n];
    st sta[n];
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        sta[i].num = a[i];
        sta[i].idx = i;
    }
    sort(sta, sta + n, cmpp);


    i64 fa[n];
    memset(fa,-1,sizeof fa);
    stack<i64> stk;
    for (int i = 0; i < n; ++i) {
        while (!stk.empty() && a[i] > a[stk.top()]) {
            fa[stk.top()] = i;
            stk.pop();
        }
        stk.push(i);
    }
    while (!stk.empty()) stk.pop();

    for (int i = n - 1; i >= 0; --i) {
        while (!stk.empty() && a[i] > a[stk.top()]) {
            if (fa[i] == -1 || a[i] < a[fa[i]]) fa[stk.top()] = i;
            stk.pop();
        }
        stk.push(i);
    }

    i64 ans[n], anss = 0;
    memset(ans, 0, sizeof ans);
    for (int i = 0; i < n; ++i) {
        if (fa[sta[i].idx] != -1) ans[sta[i].idx] = ans[fa[sta[i].idx]] + 1;
    }

    for (int i = 0; i < n; ++i) anss += ans[i];
    cout << anss << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}