## CODEM3 - Problem3

Arrays are one of the most basic and widely used Data Structures.While Data Structures like stack,queues,linked list etc are often considered as advanced so we will be playing with arrays only at the moment.So let us play a simple game.We play the game as follows: You will be given an array of integers and you can swap any two elements of the given array at a time. Swapping cost is 1 unit. The motive of the game is to append all zeros if present in the arrray to the end while keeping order of its element.

### Input

First line contains a number T.(no of test cases)
For each test case 2 lines follow,
First line contains size of array, n<=10^6.
Second line contains array elements.(-10^9 <= value of elements <= 10^9)

### Output

For each test case print on separate line the mimimum cost to obtain the motive.

### Example

```Input:
341 3 0 241 2 3 041 2 3 5

Output:
100Explaination:For first case swap 0 and 2. so array becomes 1 3 2 0 hence all zeros at the end and order of elements is preserved.(i.e 1 was before 3 , 3 was after 1 and before 2 and so on.)
```