CF2200A.Eating Game

There are $n$ players playing a game at a circular table. The $i$-th player has $a_i$ dishes to eat. They take turns eating the food, and any player can go first.

During their turn, if player $i$ has any dishes remaining, they must eat exactly one dish. Then, player $(i \bmod n) + 1$ starts their turn. This continues until all dishes are finished.

The player who eats the last dish is considered the winner. Determine the number of players that can possibly be winners.

有 $n$ 名玩家围坐在一张圆桌旁进行游戏。第 $i$ 名玩家有 $a_i$ 道菜要吃。他们轮流进食，且任意一名玩家均可率先开始。

在自己的回合中，若第 $i$ 名玩家仍有剩余的菜，则必须恰好吃掉一道菜；随后，第 $(i \bmod n) + 1$ 名玩家开始其回合。这一过程持续进行，直至所有菜均被吃完。

吃掉最后一道菜的玩家被视为获胜者。请确定可能成为获胜者的玩家人数。

The first line contains an integer $t$ ($1 \leq t \leq 5000$), the number of test cases.

The first line of each test case contains an integer $n$ ($1 \leq n \leq 10$).

The second line of each test case contains $n$ integers, the elements of $a$ ($1 \leq a_i \leq 10$).

第一行包含一个整数 $t$（$1 \leq t \leq 5000$），表示测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 10$）。

每个测试用例的第二行包含 $n$ 个整数，即数组 $a$ 的元素（$1 \leq a_i \leq 10$）。

For each test case, output a line with the answer.

对于每个测试用例，输出一行答案。

In the first test case, player $1$ wins for every starting player.

In the second test case, player $2$ wins for every starting player.

In the third test case, players $2$ and $4$ can win.

在第一个测试用例中，无论从哪位玩家开始，玩家 $1$ 均获胜。

在第二个测试用例中，无论从哪位玩家开始，玩家 $2$ 均获胜。

在第三个测试用例中，玩家 $2$ 和玩家 $4$ 可以获胜。