Remove Three, Four, or Five

Difficulty: 1800 6000 ms 128 MB

dp games

A single pile of n stones; a move removes 3, 4, or 5 stones. 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 ≤ 10⁴
• 0 ≤ n ≤ 10⁴

Sample Tests

3
0
3
10

SECOND
FIRST
SECOND

Read the Editorial