Being angry at 2 of his students for coming late to practice, Kadak Singh decided to punish them. His punishment was a very strange one. In order to punish them Kadak Singh ordered his men to draw ‘N’ contiguous pits and in the Nth pit, dirt and mud were put. Now Kadak Singh ordered both the students to step in the first pit and told them the rules :

1. The students would decide the next pit where to jump.
2. They would decide alternately.
3. If they are in the ‘k’th pit the next pit can be k+1 or 2k.
4. The student who decides the pit where to jump would step in that pit first followed by the other.
5. The first student would start.
6. They have to make a decision and cannot cross N

So the student who will have no other option than to choose the Nth pit would fall. The other student would be freed for his wit.

Now you have find for an N which student would fall. Both the students are highly intelligent.

INPUT: First line would contain T, the number of test case followed by T lines. In each line there would an N.

T<50 1<N<=1000000000

OUTPUT: For each test case you have to print who will be freed. Print either “First” or “Second”. For each test case answer in a new line.