You are playing a very popular computer game. The next level consists of n consecutive locations, numbered from 1 to n

, each of them containing either land or water. It is known that the first and last locations contain land, and for completing the level you have to move from the first location to the last. Also, if you become inside a location with water, you will die, so you can only move between locations with land.

You can jump between adjacent locations for free, as well as no more than once jump from any location with land i to any location with land i+x

, spending x coins (x≥0).

Your task is to spend the minimum possible number of coins to move from the first location to the last one.

Note that this is always possible since both the first and last locations are the land locations.

Input

There are several test cases in the input data. The first line contains a single integer t (1≤t≤100) — the number of test cases. This is followed by the test cases description.

The first line of each test case contains one integer n (2≤n≤100) — the number of locations.

The second line of the test case contains a sequence of integers a1,a2,…,an (0≤ai≤1), where ai=1 means that the i

-th location is the location with land, and ai=0 means that the i

-th location is the location with water. It is guaranteed that a1=1 and an=1.

Output

For each test case print a single integer — the answer to the problem.

Example

input

3

2

1 1

5

1 0 1 0 1

4

1 0 1 1

output

0

4

2

Note

In the first test case, it is enough to make one free jump from the first location to the second one, which is also the last one, so the answer is 0.

In the second test case, the only way to move from the first location to the last one is to jump between them, which will cost 4 coins.

In the third test case, you can jump from the first location to the third for 2 coins, and then jump to the fourth location for free, so the answer is 2. It can be shown that this is the optimal way.

中文翻譯：

您正在玩一款非常流行的電腦游戲。 下一級由n個連續(xù)的位置組成，編號從1到n

，每個區(qū)域都包含土地或水。 眾所周知，第一個和最后一個位置包含土地，要完成關(guān)卡，您必須從第一個位置移動到最后一個位置。 另外，如果你進入有水的地方，你就會死，所以你只能在有陸地的地方之間移動。

您可以免費在相鄰位置之間跳躍，并且從任何有土地 i 的位置跳躍到任何有土地 i+x 的位置不超過一次，花費 x 個硬幣（x≥0）。

您的任務(wù)是花費盡可能少的硬幣從第一個位置移動到最后一個位置。

請注意，這始終是可能的，因為第一個位置和最后一個位置都是陸地位置。

輸入

輸入數(shù)據(jù)中有幾個測試用例。 第一行包含一個整數(shù) t (1≤t≤100) — 測試用例的數(shù)量。 接下來是測試用例描述。

每個測試用例的第一行包含一個整數(shù) n

? (2≤n≤100) — 位置數(shù)。

測試用例的第二行包含整數(shù)序列a1,a2,…,an (0≤ai≤1)，其中ai=1表示第i個位置是有土地的位置，ai=0表示 第 i 個位置是有水的位置。 保證a1=1且an=1。

輸出

對于每個測試用例，打印一個整數(shù)——問題的答案。

其實就是找到左右0的位置，相減即可，沒有0則返回0.有0則返回索引的差值+1；

下面是代碼：