#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
long long arr[200005];
long long s[200005];
int max(int a, int b)
{
return a > b ? a : b;
}
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n;
scanf("%d", &n);
int flag = 0;
int ans = 0;
int sum = 0;
int add = 0;
for (int i = 1; i <= n; i++)
{
scanf("%lld", &arr[i]);
s[i] = (arr[i] + s[i - 1]);
if (flag == 0 && arr[i] == 0)
{
ans = i;
flag = 1;
}
}
int j;
//统计第一个 arr[i]==0 之前的前缀和为0的个数add
if(ans==0) ans=n+1; //可能不存在arr[i]==0,此时需要遍历整个数组