Remove Up to Half
A single pile of n stones; a move removes between 1 and ⌊n/2⌋ stones (so a pile of 1 is terminal). The player unable to move loses. For each query n, print the winner.
Input: the first line has Q; each of the next Q lines has a pile size n.
Output: one line per query.
Constraints:
- 1 ≤ Q ≤ 104
- 0 ≤ n ≤ 104
Sample Tests
Input 1
3 1 4 7
Output 1
SECOND FIRST SECOND
Discussion (opens after you solve — no spoilers before)
No comments yet.