import java.util.*;
public class Main {
	//static long dp[][];
	static long pre[];
    public static void main(String args[]) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while(t-->0){
	int n=sc.nextInt();
	int arr[]=new int[n];
	for(int i=0;i<n;i++)
	arr[i]=sc.nextInt();


    pre=new long[n+1];
   pre[0]=0;
   //pre[1]=arr[1];
   
   for(int i=1;i<=n;i++)
   pre[i]=pre[i-1]+arr[i-1];
	//dp=new long[n][n];
	// for(int i=0;i<n;i++)
	// Arrays.fill(dp[i],(long)-1);
System.out.println(f(arr,0,n-1));
} 
    }
	static long f(int arr[],int i,int j){
           if(i>=j)
		   return 0;
		   if(i+1==j){
			   if(arr[i]==arr[j])
               return 1;
			   else
			   return 0;
		   }
	long result=0;
		   for(int k=i;k<j;k++){
			   long ans=0;
			   if(pre[k+1]-pre[i]==pre[j+1]-pre[k+1]){
			    ans= 1+(long)Math.max((long)f(arr,i,k),(long)f(arr,k+1,j));
			   result=Math.max(result,ans);
			   break;
			   }
		   }
		   //dp[i][j]=result;
		   return result;
	}
	
}