Arpit & Nikhil were bored from their usual routine of studying, so they decided to play a game.
The game was as follows - Given a number N the player must subtract 1, 2 or 3 from N in order to
make a number that is divisble by 4. The game will continue until any player is able to make such
a number, the corresponding player to make the number wins. Nikhil allows Arpit to start the game
but on one condition, he must subtract 1,2 or 3 from N in the first move. Both players play optimally.
Vaibhav, their mutual friend , was observing them play. Can you help Vaibhav predict the outcome of
the game? If Arpit wins print "First" without quotes and "Second" without quotes, if Nikhil wins.

Input
First line contains number of testcases T.
T lines follow each containing integer N.

Output
Outcome of each game in a separate line

Constraints
1 <= T <= 100000 4 <= N <= 100000

Example
Input:
1
6
Output:
First

见题面

见题面