#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn = 100010;
int t, n, f, arr[maxn], sum[maxn];

int main(){
    scanf("%d", &t);

    for(int it = 0; it < t; it++){
        scanf("%d", &n);

        sum[0] = 0, f = -1;
        for(int i = 0; i < n; i++){
            scanf("%d", arr + i);
            sum[i] += arr[i];
            sum[i + 1] = sum[i];

            if(!arr[i] && f == -1){
                f = i;
            }
        }

        int ans = 0;
        for(int i = n - 1; i > max(0, f); i--){
            if(arr[i]){
                ans = max(ans, i - sum[i - 1] + sum[n - 1] - sum[i]);
            }
        }

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

    return 0;
}