# B. Coins

Time limit: 1s Memory limit: 64MB Input: Output:

Two players alternatively play the following game:

There are initially $n$ coins. In one move, supposing that the current number of coins is $x$, the current player can either:

1. Take one coin
2. Take multiple coins, provided that the remaining number of coins is a divisor of $x$.

The game ends when there are no coins left. The player who took the last coin is considered the winner.

Given the number of coins $n$, your task is to find which player will win the game, supposing that both of them play optimally.

## Input

Each test contains multiple testcases. The first line of input contains one integer $t$ ($1 \le t \le 10^3$) — the number of testcases.

Each testcase consists of one line, containing $n$ ($1 \le n \le 10^9$) — the number of coins.

## Output

For each testcase, print either First or Second, depending on the player who will win the game.

## Example

stdin

12
1
2
3
4
5
6
7
8
9
10
27
85653439


stdout

First
Second
First
First
Second
First
Second
First
Second
First
First
Second