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

public class Solution{
    public static void main(String args[]){
	Scanner cin = new Scanner(System.in);
	
	int ttime = cin.nextInt();
	for (int ccount=0;ccount<ttime;ccount++){
	    int n = cin.nextInt();
	    int num[] = new int[n];
	    for (int i=0;i<n;i++)
		num[i] = cin.nextInt();

	    int sum[] = new int[n];
	    sum[0] = num[0];
	    for (int i=1;i<n;i++)
		sum[i] = sum[i-1] + num[i];

	    Set<Integer> set = new TreeSet<Integer>();
	    for (int i=0;i<n;i++)
		for (int j=i;j<n;j++){
		    int summuation;
		    if (i == 0)
			summuation = sum[j];
		    else
			summuation = sum[j] - sum[i-1];
		    set.add(summuation);
		}
	    System.out.println(set.size());
	}
    }
}