#include<bits/stdc++.h>
#define int long long
using namespace std;
int dp[200005],pd[200005],d[200005],p[200005];
int a[200005];
signed main()
{
  int t;
  cin >> t;
  while(t--)
  {
    int n;
    stack<int>sk;
    cin >> n;
    int mx=0;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i];
        mx=max(a[i],mx);
    }
    for(int i=1;i<=n;i++)
    {
        if(a[i]==mx)
        {  
            i++;
            int flag=i;
            int mx1=0;
            int len=0;
            while(a[i]!=mx&&i<=n)
            {
                if(i==flag)
                {
                  dp[i]=1;
                  mx1=a[i];
                  len=1;
                }
                else
                {
                     if(a[i]<a[i-1])
                     {
                        dp[i]=dp[i-1]+1;
                     }
                     else if(a[i]==a[i-1])
                     {
                        dp[i]=dp[i-1];
                     }
                     else
                     {
                         if(a[i]>mx1)
                         {
                            d[i]=i-(flag);
                            dp[i]=1;
                            mx1=a[i];
                         }
                         else if(a[i]==mx1)
                         {
                               dp[i]=1;
                         }
                         else
                         {
                            int base=0;
                          while(sk.size()&&a[i]>=a[sk.top()])
                           {
                             base=sk.top();
                              sk.pop();
                           }
                           if(sk.size())
                           {
                            if(a[i]==a[base])
                            {
                                dp[i]=dp[base];
                            }
                            else
                            {
                            dp[i]=dp[sk.top()]+1;
                            d[i]=i-sk.top();
                            }
                           }
                         sk.push(i);
                        
                         }
                     }
                }
                 while(sk.size()&&a[i]>=a[sk.top()])
                           {
                              sk.pop();
                           }
                         sk.push(i);
                i++;
              
            }
            i--;
        }
    }
    while(sk.size())
    sk.pop();
     for(int i=n;i>=1;i--)
    {
        if(a[i]==mx)
        {  
            i--;
            int flag=i;
            int mx1=0;
            int len=0;
            while(a[i]!=mx&&i>0)
            {
                if(i==flag)
                {
                  pd[i]=1;
                  mx1=a[i];
                  len=1;
                }
                else
                {
                     if(a[i]<a[i+1])
                     {
                        pd[i]=pd[i+1]+1;    
                     }
                     else if(a[i]==a[i+1])
                     {
                        pd[i]=pd[i+1];
                     }
                     else
                     {
                         if(a[i]>mx1)
                         {
                            p[i]=flag-i;
                            pd[i]=1;
                            mx1=a[i];
                         }
                         else if(a[i]==mx1)
                         {
                               pd[i]=pd[i+1];
                         }
                         else
                         {
                            int base=0;
                             while(sk.size()&&a[i]>=a[sk.top()])
                           {
                            base=sk.top();
                              sk.pop();
                           }
                           if(sk.size())
                           {
                            if(a[base]==a[i])
                            {
                                pd[i]=pd[base];
                            }
                            else
                            {
                            pd[i]=pd[sk.top()]+1;
                            p[i]=sk.top()-i;
                            }
                           }
                         sk.push(i);
                         }
                     }
                }

                  while(sk.size()&&a[i]>=a[sk.top()])
                           {
                              sk.pop();
                           }
                         sk.push(i);
                i--;
            }
            i++;
        }
    }
    int ans=0,sum=0,num=0;
    for(int i=1;i<=n;i++)
    {
        sum+=dp[i]+d[i];
        num+=pd[i]+p[i];
        dp[i]=d[i]=pd[i]=p[i]=0;
        if(a[i]==mx)
        {
        ans+=max(sum,num);
        sum=num=0;
        }
     }
      ans+=max(sum,num);
    cout <<ans<<'\n';
  }
}