C. Stones Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Two players are playing a game with a pile of $$$N$$$ stones. The rules of the game are as follows:

  • The players take turns alternately.
  • In each move, the current player must remove a positive number of stones from the pile.
  • The number of stones that can be removed must be strictly less than the most significant bit $$$^\dagger$$$(MSB) of the remaining pile size.

The player who cannot make a move loses the game. Determine the winner if both players play optimally.

$$$^\dagger$$$The most significant bit (MSB) is the value of the highest position that has a $$$1$$$ in the binary representation. For example, for $$$13_{10}=1101_{2}$$$, the most significant bit is $$$8_{10}=1000_2$$$

Input

Each test consists of multiple testcases. The first line contains an integer $$$t$$$ $$$(1\le t \le 10^5)$$$ — the number of testcases.

The single line of each testcase contains an integer $$$N$$$ $$$( 1 \le N \le 10^{18} )$$$ — the number of stones in the pile.

Output

Print for each testcase, 'First' if the first player wins, or 'Second' otherwise.

Example
Input
4
1
2
3
4
Output
Second
First
Second
First