Remove a Power of Two
A single pile of n stones; a move removes a power of two (1, 2, 4, 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 ≤ 104
- 0 ≤ n ≤ 104
Sample Tests
Input 1
3 0 3 7
Output 1
SECOND SECOND FIRST
Discussion (opens after you solve — no spoilers before)
No comments yet.