- Time limit: 1.00 s
- Memory limit: 512 MB
Your task is to find out who wins if both players play optimally.
The first input line contains an integer $t$: the number of tests.
After this, there are $t$ lines that describe the tests. Each line has an integer $n$: the number of coins in the initial heap.
For each test case, print "first" if the first player wins the game and "second" if the second player wins the game.
- $1 \le t \le 10^5$
- $1 \le n \le 10^6$