영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There are n 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 t: the number of tests. After this, t test cases are described:
The first line contains an integer n: the number of heaps.
The next line has n integers x_1,x_2,…,x_n: 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
- 1 ≤ t ≤ 2 · 10^5
- 1 ≤ n ≤ 2 · 10^5
- 1 ≤ x_i ≤ 10^9
- the sum of all n is at most 2 · 10^5
예제
예제 1
3 3 1 2 3 2 2 2 4 5 5 4 5
first second first