CF1899A.Game with Integers

Vanya and Vova are playing a game. Players are given an integer $n$. On their turn, the player can add $1$ to the current integer or subtract $1$. The players take turns; Vanya starts. If after Vanya's move the integer is divisible by $3$, then he wins. If $10$ moves have passed and Vanya has not won, then Vova wins.

Write a program that, based on the integer $n$, determines who will win if both players play optimally.

瓦尼亚和沃瓦正在玩一个游戏。玩家会得到一个整数 $n$。在自己的回合中，玩家可以将当前整数加 $1$ 或减 $1$。双方轮流进行，瓦尼亚先手。如果在瓦尼亚操作之后该整数能被 $3$ 整除，则瓦尼亚获胜。如果经过 $10$ 回合后瓦尼亚仍未获胜，则沃瓦获胜。

请编写一个程序，根据初始整数 $n$ 判断：若双方均采取最优策略，谁将获胜？

The first line contains the integer $t$ ($1 \leq t \leq 100$) — the number of test cases.

The single line of each test case contains the integer $n$ ($1 \leq n \leq 1000$).

第一行包含整数 $t$（$1 \leq t \leq 100$）——测试用例的数量。

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

For each test case, print "First" without quotes if Vanya wins, and "Second" without quotes if Vova wins.

对于每个测试用例，如果万尼亚获胜，则输出不带引号的 “First”；如果沃瓦获胜，则输出不带引号的 “Second”。