Codeforces Round 909 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

games

math

number theory

*800

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Game with Integers

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVanya 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.

Input

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$$$).

Output

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

Example

Input

61351009991000

Output

First Second First First Second First

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/11/2023 08:38:21 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|