import java.util.*;
import java.io.*;

public class Main
{
    //    static Scanner sc = new Scanner( System.in );
    
    public static void main( String[] ksc ) throws Exception
    {
        int t = nextInt();
        while( t-- > 0 ) solve();
    }
    
    static long max, sum;
    static ArrayList< r > arr;
    static ArrayList< Integer > max_q;
    
    private static void solve() throws Exception
    {
        int n = nextInt();
        arr = new ArrayList<>();
        max_q = new ArrayList<>();
        long cnt = 0, val = 0;
        sum = 0;
        max = 0;
        int t = 0;
        for( int i = 0; i < n; i++ )
        {
            long key = nextLong();
            if( val != key )
            {
                if( cnt != 0 )
                {
                    get_max( val, t );
                    arr.add( new r( val, cnt, t++ ) );
                }
                
                val = key;
                cnt = 1;
            } else cnt++;
        }
        get_max( val, t );
        arr.add( new r( val, cnt, t ) );
        
        Collections.sort( arr );
        
        for( int i = 0; i < max_q.size(); i++ )
        {
            int l = i == 0 ? 0 : max_q.get( i - 1 );
            int r = i == max_q.size() - 1 ? arr.size() - 1 : max_q.get( i );
            find( 1, l, r, 0, max );
        }
        
        pw.println( sum );
        pw.flush();
    }
    
    private static void get_max( long val, int t )
    {
        if( val > max )
        {
            max = val;
            max_q = new ArrayList<>();
        }
        if( val == max ) max_q.add( t );
    }
    
    private static void find( int cnt, int l, int r, int maxi_now, long max_now )
    {
        if( l > r || maxi_now >= arr.size() ) return;
        if( l < 0 || r >= arr.size() ) return;
        while( arr.get( maxi_now ).v == max_now )
        {
            maxi_now++;
            if( maxi_now >= arr.size() ) return;
        }
        while( !( arr.get( maxi_now ).i <= r && arr.get( maxi_now ).i >= l ) )
        {
            maxi_now++;
            if( maxi_now >= arr.size() ) return;
        }
        sum += cnt * arr.get( maxi_now ).c;
        find( cnt + 1, l, arr.get( maxi_now ).i - 1, maxi_now + 1, arr.get( maxi_now ).v );
        find( cnt + 1, arr.get( maxi_now ).i + 1, r, maxi_now + 1, arr.get( maxi_now ).v );
    }
    
    static class r implements Comparable< r >
    {
        long v, c;
        int i;
        
        r( long v, long c, int i )
        {
            this.c = c;
            this.v = v;
            this.i = i;
        }
        
        @Override
        public int compareTo( r o )
        {
            return (int) ( ( o.v - this.v ) % 195329 );
        }
    }
    
    static BufferedReader bf = new BufferedReader( new InputStreamReader( System.in ) );
    static StreamTokenizer st = new StreamTokenizer( bf );
    static PrintWriter pw = new PrintWriter( new OutputStreamWriter( System.out ) );
    
    private static int nextInt() throws IOException
    {
        st.nextToken();
        return (int) st.nval;
    }
    
    private static long nextLong() throws IOException
    {
        st.nextToken();
        return (long) st.nval;
    }
}