Chef has a binary array in an unsorted manner. Cheffina challenges chef to find the transition point in the sorted (ascending) binary array. Here indexing is starting from 0.
Note: Transition point always exists.
-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains two lines of input, $N$.
- N space-separated binary numbers. 
-----Output:-----
For each test case, output in a single line answer.
-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
-----Sample Input:-----
1
5
0 1 0 0 1
-----Sample Output:-----
3
-----EXPLANATION:-----
binary array in sorted form will look like = [0, 0, 0, 1, 1]
list = []

x = int(input())
output = []
for i in range(x):
    count = 0
    val = int(input())
    line = input()
    z = line.split()
    z = [int(y) for y in z]
    for j in z:
        if j == 0:
            count += 1
    
    output.append(count)
for i in output:
    print(i)
list = []

x = int(input())
output = []
for i in range(x):
    count = 0
    val = int(input())
    line = input()
    z = line.split()
    z = [int(y) for y in z]
    for j in z:
        if j == 0:
            count += 1
    
    output.append(count)
for i in output:
    print(i)