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

public class Main {
		static PrintWriter out=new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		static StreamTokenizer in=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		static HashMap<Integer, List<Integer>> map=new HashMap<>();
		static TreeSet<Integer> set=new TreeSet<>();
		static int[] arr=new int[200000+5];
		public static void main(String[] args) throws IOException {
				in.nextToken();int t=(int)in.nval;
				while(t-->0){
						map.clear();
						set.clear();
						in.nextToken();int n=(int)in.nval;
						for(int i=0;i<n;i++){
								in.nextToken();arr[i]=(int)in.nval;
								if(!map.containsKey(arr[i])){
										map.put(arr[i],new ArrayList<>());
										set.add(arr[i]);
								}
								map.get(arr[i]).add(i);
						}
						long cnt=0;
						for(Integer temp:set){
								for(int i=0;i<map.get(temp).size();i++){
										int left=map.get(temp).get(i),right=map.get(temp).get(i);
										while(right<n-1&& arr[right]==arr[right+1]){
												right++;
										}
										while(left>=1&& arr[left]==arr[left-1]){
												left--;
										}
										if(left-1<0&&right+1>=n){
												break;
										}else if(left-1<0||right+1>=n){
												cnt+=right-left+1;
												int min=left-1<0?right+1:left-1;
												for(int j=left;j<=right;j++){
														arr[j]=arr[min];
												}
										}else{
												cnt+=right-left+1;
												int min=Math.min(arr[left-1],arr[right+1]);
												for(int j=left;j<=right;j++){
														arr[j]=min;
												}
										}
								}
						}
						out.println(cnt);
				}
				out.close();
		}
}