There are heaps of coins and two players who move alternately. On each move, a player selects some of the nonempty heaps and removes one coin from each heap. The player who removes the last coin wins the game.
Your task is to find out who wins if both players play optimally.
Input
The first input line contains an integer : the number of tests. After this, test cases are described:
The first line contains an integer : the number of heaps.
The next line has integers : the number of coins in each heap.
Output
For each test case, print "first" if the first player wins the game and "second" if the second player wins the game.
Constraints
- the sum of all is at most
Example
Input:
3 3 1 2 3 2 2 2 4 5 5 4 5
Output:
first second first
Statement © the CSES Problem Set. View the original
The specification is at TalosEval/Problems/CSES/AnotherGame/Spec.lean.
Submit
binary + proofResults
No scoring submissions yet. One counts once the kernel accepts its proof and every test passes.
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.