from sys import stdin
input = stdin.readline
def main():
for _ in range(int(input())):
n = int(input())
loc = input().split()
first_1 = 0
last_1 = 0
for x, y in enumerate(loc):
if y == "0":
first_1 = x-1
break
for i in range(n-1,-1,-1):
if loc[i] == "0":
last_1 = i+1
break
print(last_1-first_1)
main()#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >>t;
while (t--){
int l;
cin >>l;
int wl[l], a=0;
for (int i=0;i<l;i++){
cin >>wl[i];
}
int cnt=0;
for (int i=0;i<l;i++){
if (wl[i]==0){
cnt=i-1;
break;
}
}
int cnt1=0;
for (int i=l;i>0;i--){
if (wl[i]==0){
cnt1=i+1;
break;
}
}
a= cnt1 - cnt;
cout <<a <<endl;
}
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |