#include <stdio.h>

 #include <algorithm>

 #include <algorithm>

 using namespace std;

 const int N = 2e5 + ;

 int a[N];

 int pre[N],suf[N];

 int min_pre_qian[N],min_pre_hou[N];

 int main()

 {

     int T;

     scanf("%d",&T);

     while(T--)

     {

         int n;

         scanf("%d",&n);

         for(int i=;i<=n;i++)

         {

             scanf("%d",a+i),pre[i] = pre[i-] + a[i];

             if(i == ) min_pre_qian[i] = pre[];

             else min_pre_qian[i] = min(pre[i], min_pre_qian[i-]);

         }

         suf[n+] = ;

         for(int i=n;i>=;i--)

         {

             suf[i] = suf[i+] + a[i];

             if(i == n) min_pre_hou[i] = pre[i];

             else min_pre_hou[i] = min(min_pre_hou[i+], pre[i]);

             //min_suf[i] = min(suf[i], min_suf[i+1]);

         }

         int ans = ;

         for(int i=;i<=n;i++)

         {

             //printf("%d %d %d %d %d ??\n",i,min_pre_hou[i],pre[i-1],suf[i],max_pre_qian[i-1]);

             if(min_pre_hou[i] - pre[i-] >  && suf[i] + min_pre_qian[i-] > )

             {

                 ans++;

             }

         }

         printf("%d\n",ans);

     }

 }