#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

struct r {
    ll v, c;
    int i;
    bool operator<(const r& o) const {
        return v > o.v;
    }
};

vector<r> arr;
vector<int> max_q;
ll max_val, sum;

void get_max(ll val, int t) {
    if (val > max_val) {
        max_val = val;
        max_q.clear();
    }
    if (val == max_val) max_q.push_back(t);
}

void find(int cnt, int l, int r, int maxi_now, ll max_now) {
    if (l > r || maxi_now >= arr.size()) return;
    if (l < 0 || r >= arr.size()) return;
    while (maxi_now < arr.size() && arr[maxi_now].v == max_now) {
        maxi_now++;
    }
    while (maxi_now < arr.size() && !(arr[maxi_now].i <= r && arr[maxi_now].i >= l)) {
        maxi_now++;
    }
    if (maxi_now < arr.size()) {
        sum += cnt * arr[maxi_now].c;
        find(cnt + 1, l, arr[maxi_now].i - 1, maxi_now + 1, arr[maxi_now].v);
        find(cnt + 1, arr[maxi_now].i + 1, r, maxi_now + 1, arr[maxi_now].v);
    }
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        arr.clear();
        max_q.clear();
        sum = 0;
        max_val = 0;
        ll cnt = 0, val = 0;
        int t = 0;
        for (int i = 0; i < n; i++) {
            ll key;
            cin >> key;
            if (val != key) {
                if (cnt != 0) {
                    get_max(val, t);
                    arr.push_back({ val, cnt, t++ });
                }
                val = key;
                cnt = 1;
            }
            else cnt++;
        }
        get_max(val, t);
        arr.push_back({ val, cnt, t });
        sort(arr.begin(), arr.end());
        for (int i = 0; i < max_q.size(); i++) {
            int l = i == 0 ? 0 : max_q[i - 1];
            int r = i == max_q.size() - 1 ? arr.size() - 1 : max_q[i];
            if (l == r) continue;
            find(1, l, r, 0, max_val);
        }
        cout << sum << endl;
    }
    return 0;
}