#include<bits/stdc++.h>

using namespace std;
#define int long long
#define ll long long
#define db double
const int mod = 1e9 + 7;
const int N = 1e3 + 5;
const double eps = 1e-10;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 5);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    vector<int> p(n + 5);
    vector<int> num(n + 5);
    int ans = 0;
    int cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (cnt) {
            if (p[cnt] > a[i]) {
                p[++cnt] = a[i];
                num[cnt] = 1;
            } else if (p[cnt] == a[i]) {
                num[cnt]++;
            } else {
                int l = 1, r = cnt;
                while (l < r) {
                    int mid = (l + r) / 2;
                    if (p[mid] < a[i])r = mid;
                    else l = mid + 1;
                }
                for (int i = cnt; i >= l; i--) {
                    num[i - 1] += num[i];
                    ans += num[i];
                }
                cnt = l;
                p[cnt] = a[i];
                num[l]++;
                if (cnt - 1 >= 1 && p[cnt - 1] == p[cnt]) {
                    num[cnt - 1] += num[cnt];
                    cnt--;
                }
            }
        } else {
            p[++cnt] = a[i];
            num[cnt] = 1;
        }
    }
    for (int i = cnt; i >= 2; i--) {
        num[i - 1] += num[i];
        ans += num[i];
    }
    cout << ans << '\n';

}


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    srand(time(0));
    int T = 1;
    // cout<<fixed<<setprecision(10);
    cin >> T;

    while (T--)solve();
    return 0;
}