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

using namespace std;


int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t > 0) {
        int n;
        cin >> n;
        vector<long long> arr(n);
        unordered_map<long long, int> first, last;

        for (int i = 0; i < n; i++) {
            cin >> arr[i];
            last[arr[i]] = i;
        }
        for (int i = n - 1; i >= 0; i--) {
            first[arr[i]] = i;
        }

        stack<int> stack;
        vector<int> left(n, -1);
        vector<int> right(n, n);

        // Find left limits
        for (int i = 0; i < n; i++) {
            if (!stack.empty() && arr[i] < arr[stack.top()]) {
                left[i] = stack.top();
            } else {
                stack.push(i);
            }

        }

        // Clear stack for right limits
        while (!stack.empty()) {
            stack.pop();
        }

        // Find right limits
        for (int i = 0; i < n; i++) {
            while (!stack.empty() && arr[i] > arr[stack.top()]) {
                right[stack.top()] = i;
                stack.pop();
            }
            stack.push(i);
        }

        long long ans = 0;
        for (const auto &entry: first) {
            int index = entry.second;
            if (left[index] != -1) {
                ans += index - left[index] - 1;
            } else {
                ans += index;
            }
        }
        for (const auto &entry: last) {
            int index = entry.second;
            if (right[index] != n) {
                ans += right[index] - index - 1;
            } else {
                ans += n - 1 - index;
            }
        }
        cout << ans << endl;
        t--;
    }
    return 0;
}