CF1382B.Sequential Nim

There are $n$ piles of stones, where the $i$-th pile has $a_i$ stones. Two people play a game, where they take alternating turns removing stones.

In a move, a player may remove a positive number of stones from the first non-empty pile (the pile with the minimal index, that has at least one stone). The first player who cannot make a move (because all piles are empty) loses the game. If both players play optimally, determine the winner of the game.

有 $n$ 堆石子，其中第 $i$ 堆有 $a_i$ 颗石子。两人轮流进行游戏，每次轮到一名玩家时，他必须从第一个非空石子堆（即下标最小、且至少含有一颗石子的那堆）中取走正整数颗石子。

当一名玩家无法进行任何操作（即所有石子堆均为空）时，该玩家输掉游戏。若双方均采取最优策略，请判断游戏的获胜者。

The first line contains a single integer $t$ ($1\le t\le 1000$) — the number of test cases. Next $2t$ lines contain descriptions of test cases.

The first line of each test case contains a single integer $n$ ($1\le n\le 10^5$) — the number of piles.

The second line of each test case contains $n$ integers $a_1,\ldots,a_n$ ($1\le a_i\le 10^9$) — $a_i$ is equal to the number of stones in the $i$-th pile.

It is guaranteed that the sum of $n$ for all test cases does not exceed $10^5$.

第一行包含一个整数 $t$（$1\le t\le 1000$）—— 表示测试用例的数量。接下来的 $2t$ 行包含各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$1\le n\le 10^5$）—— 表示石堆的数量。

每个测试用例的第二行包含 $n$ 个整数 $a_1,\ldots,a_n$（$1\le a_i\le 10^9$）—— 其中 $a_i$ 表示第 $i$ 堆石子的数量。

保证所有测试用例的 $n$ 之和不超过 $10^5$。

For each test case, if the player who makes the first move will win, output "First". Otherwise, output "Second".

对于每个测试用例，若先手玩家获胜，则输出 “First”；否则输出 “Second”。

In the first test case, the first player will win the game. His winning strategy is:

1. The first player should take the stones from the first pile. He will take $1$ stone. The numbers of stones in piles will be $[1, 5, 4]$.
2. The second player should take the stones from the first pile. He will take $1$ stone because he can't take any other number of stones. The numbers of stones in piles will be $[0, 5, 4]$.
3. The first player should take the stones from the second pile because the first pile is empty. He will take $4$ stones. The numbers of stones in piles will be $[0, 1, 4]$.
4. The second player should take the stones from the second pile because the first pile is empty. He will take $1$ stone because he can't take any other number of stones. The numbers of stones in piles will be $[0, 0, 4]$.
5. The first player should take the stones from the third pile because the first and second piles are empty. He will take $4$ stones. The numbers of stones in piles will be $[0, 0, 0]$.
6. The second player will lose the game because all piles will be empty.

在第一个测试用例中，先手玩家将赢得游戏。他的必胜策略如下：

1. 先手玩家应从第一堆石子中取石子，取 $1$ 颗。各堆石子数量变为 $[1, 5, 4]$。
2. 后手玩家必须从第一堆石子中取石子（因为规则限制），且只能取 $1$ 颗（他无法取其他数量的石子）。各堆石子数量变为 $[0, 5, 4]$。
3. 先手玩家应从第二堆石子中取石子（因为第一堆已空）。他将取 $4$ 颗石子。各堆石子数量变为 $[0, 1, 4]$。
4. 后手玩家必须从第二堆石子中取石子（因为第一堆已空），且只能取 $1$ 颗石子（他无法取其他数量的石子）。各堆石子数量变为 $[0, 0, 4]$。
5. 先手玩家应从第三堆石子中取石子（因为第一堆和第二堆均已空）。他将取 $4$ 颗石子。各堆石子数量变为 $[0, 0, 0]$。
6. 后手玩家将输掉游戏，因为所有石子堆均已为空。