#include <bits/stdc++.h>
// #pragma GCC optimize(2)
#ifndef ONLINE_JUDGE
    #define Debug
#endif
#define multiple_test 1
#define int int64_t
const int MAXN = 1e6, N = MAXN + 10;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f3f3f3f3fll;
using namespace std;

int a[N], b[N], dp[N];

inline void solve() {
    int n; cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        b[i] = i;
        dp[i] = 0;
    }
    sort(b + 1, b + 1 + n, [](int x, int y) {
        return a[x] > a[y];
    });
    dp[0] = dp[n + 1] = -1;
    a[0] = a[n + 1] = INF; 
    set<int> st;
    st.emplace(0); st.emplace(n + 1);

    for(int k = 1; k <= n; k++) {
        int i = b[k];
        int nxt = *st.lower_bound(i);
        int pre = *(st.lower_bound(i)--);
        if(a[i] == a[nxt]) dp[i] = max(dp[i], dp[nxt]);
        else dp[i] = max(dp[i], dp[nxt] + 1);
        if(a[i] == a[pre]) dp[i] = max(dp[i], dp[pre]);
        else dp[i] = max(dp[i], dp[pre] + 1);
        st.emplace(i);
    }
    int res = 0;
    for(int i = 1; i <= n; i++) {
        res += dp[i];
        // cout << dp[i] << " \n"[i == n];
    }
    cout << res << "\n";
}

signed main() {
#ifndef ONLINE_JUDGE
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    clock_t start_time = clock();
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
#endif 
    int t = 1; if(multiple_test) cin >> t;
    while(t--) {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << clock() - start_time << " ms" << endl;
#endif
    return 0;
}