Remove a Fibonacci Number

Difficulty: 1800 6000 ms 128 MB

dp games

A single pile of n stones; a move removes a Fibonacci number of stones (1, 2, 3, 5, 8, ...). The player who cannot move loses. For each query n, print the winner under perfect play.

Input: the first line has Q; each of the next Q lines has a pile size n.

Output: one line per query: FIRST or SECOND.

Constraints:

• 1 ≤ Q ≤ 10⁴
• 0 ≤ n ≤ 10⁴

Sample Tests

3
0
4
10

SECOND
SECOND
SECOND

Read the Editorial