// gfsgfsdg
//  ffff
//  faruk
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fastio                  \
  ios_base::sync_with_stdio(0); \
  cin.tie(0)
#define YES cout << "Yes\n";
#define NO cout << "No\n";
#define SetBit(x, k) (x |= (1ll << k))
#define ClearBit(x, k) (x &= ~(1ll << k))
#define CheckBit(x, k) ((x >> k) & 1)
#define CC(x) cout << "Case " << ++x << ": ";
#define all(x) x.begin(), x.end()
#define INF 1e12 + 10
#define pi pair<ll, ll>
ll i, j, k, a, b, c, d, e, f, n, l, m, w;
vector<ll> vk;
// // PBDS start
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <class K, class V>
// using ordered_map = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>;
// // less<T> for uniqe elements ,, less_equal<T> for duplicate
// //   PBDS end

const ll M = 1e9 + 7;
const int N = 4e5 + 10;
const int Ni = 1e6 + 10;
long long int binE(ll a, ll b)
{
  ll res = 1;
  while (b > 0)
  {
    if (b & 1)
      res = (res * a) % M;

    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
map<ll, ll> vis, vis1;
bool cmp(pair<string, pi> p1, pair<string, pi> p2)
{
  if (p1.second.first == p2.second.first)
  {
    return p1.second.second < p2.second.second;
  }
  else
    return p1.second.first > p2.second.first;
}
ll tta;
ll arr[N];
void solve()
{
 ll ans=0;
 cin>>n;  
 vis.clear();
 stack<pi>lefter,righter;
 for(ll i=1;i<=n;i++)cin>>arr[i];
 map<ll,ll>khise;
 for(ll i=1;i<=n;i++){
  ll cnt=0;
  while (lefter.size()&&lefter.top().first<arr[i])
  {
     cnt+=(vis[lefter.top().second]+1);
     khise[lefter.top().second]=arr[i];
     lefter.pop();
  }
  vis[i]=cnt;
  lefter.push({arr[i],i});
 }
 vis1.clear();
 for(ll i=n;i>=1;i--){
  ll cnt=0;
  while (righter.size()&&righter.top().first<arr[i]&&(khise[righter.top().second]!=arr[i]))
  {
     cnt+=(vis1[righter.top().second]+1);
     righter.pop();
  }
  vis1[i]=cnt;
   righter.push({arr[i],i});
 }
 for(ll i=1;i<=n;i++)ans+=(vis[i]+vis1[i]);
 cout<<ans<<endl;
}

int32_t main()
{
  fastio;

  int testcase = 1;
  cin >> testcase;
  ll x = 0;
  // fact[0]=1;
  // for(ll i=1;i<=N;i++){
  //    fact[i]=(i*fact[0])%M;
  //    if(fact[i]<0)fact[i]+=M;
  // }
  // cout<<testcase<<endl;
  while (testcase--)
  {
    // cout<<testcase<<endl;
    vk.clear();
    // CC(x)
    // memset(dp,-1,sizeof(dp));
    solve();
  }
  return 0;
}