#include <cstdlib>
#include <iostream>
#include <stdio.h>
#include <cstring>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <set>
#include <stack>
#include <cmath>
#include <map>

#define INF 99999999
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define tr(c, it) for ( typeof(c.begin()) it = (c).begin();  it != (c).end(); it++)
#define pb push_back

using namespace std;

typedef pair < int, int >  ii;
typedef vector < int >  vi;
typedef vector < ii >  vii;


map <int , int> mp, msoma;
int soma;
int v[1050000];

int busca(int ini, int fim , int x)
{
    if (ini>fim) return 0;
    int me = (ini+fim)/2;
    if (v[me] == x) return me;
    else if (v[me] < x) return busca(me+1,fim,x);
    else return busca(ini,me-1,x);
    return 0;
}

int main(){

    int casos, n, num;

    scanf("%d",&casos);

        while(casos -- ){

            scanf("%d",&n);

            soma = 0;
            v[0] = 0;

            rep(i,1,n+1){
                scanf("%d",&num);
                v[i] = soma+num;
                soma+=num;
            }

            int i, j, cont = 0;

            for(i = 0 ; i <= n ; i++){
                 j = busca(0, n, v[i]+42);
                 if(j) {
                    cont++;
                    i = j-1;
                 }
            }
            printf("%d\n",cont);
        }
   return 0;
}