CF1649A.Game

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 \geq 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.

你正在玩一款非常流行的电脑游戏。下一关由 $n$ 个连续的位置组成，编号从 $1$ 到 $n$，每个位置要么是陆地，要么是水。已知第一个和最后一个位置均为陆地；要通关，你必须从第一个位置移动到最后一个位置。此外，一旦你进入一个水的位置，你就会死亡，因此你只能在陆地位置之间移动。

你可以免费在相邻位置之间跳跃；此外，你最多可以进行一次长跳：从任意一个陆地位置 $i$ 跳到另一个陆地位置 $i + x$（其中 $x \geq 0$），花费 $x$ 枚金币。

你的任务是以最少的金币花费，从第一个位置移动到最后一个位置。

注意：这总是可行的，因为第一个和最后一个位置均为陆地。

There are several test cases in the input data. The first line contains a single integer $t$ ($1 \leq t \leq 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 \leq n \leq 100$) — the number of locations.

The second line of the test case contains a sequence of integers $a_1, a_2, \ldots, a_n$ ($0 \leq a_i \leq 1$), where $a_i = 1$ means that the $i$-th location is the location with land, and $a_i = 0$ means that the $i$-th location is the location with water. It is guaranteed that $a_1 = 1$ and $a_n = 1$.

输入数据包含多个测试用例。第一行包含一个整数 $t$（$1 \leq t \leq 100$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$2 \leq n \leq 100$），表示位置的数量。

每个测试用例的第二行包含一个整数序列 $a_1, a_2, \ldots, a_n$（$0 \leq a_i \leq 1$），其中 $a_i = 1$ 表示第 $i$ 个位置为陆地，$a_i = 0$ 表示第 $i$ 个位置为水域。保证 $a_1 = 1$ 且 $a_n = 1$。

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

对于每个测试用例，输出一个整数——即该问题的答案。

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.

在第一个测试用例中，只需从第一个位置免费跳转到第二个位置（同时也是最后一个位置），因此答案为 $0$。

在第二个测试用例中，从第一个位置移动到最后一个位置的唯一方式是直接在这两个位置之间跳跃，花费 $4$ 枚硬币。

在第三个测试用例中，你可以先从第一个位置跳到第三个位置，花费 $2$ 枚硬币，再从第三个位置免费跳到第四个位置，因此答案为 $2$。可以证明这是最优方案。