Variation of NIM#3722
On the table, there are piles of stones: a_1 stones in the first pile, a_2 stones in the second pile, and so on, up to a_n stones in the -th pile. Two players take turns playing a game. During each turn, a player can either take any non-zero number of stones (including all) from one pile or split any pile that has at least two stones into two non-empty piles in any way they choose. The player who cannot make a move loses the game. Determine who wins with perfect play.
The first line contains an integer — the number of test cases (1 \leq t \leq 100). Each of the following lines describes a test case. Each line begins with an integer — the number of piles (1 \leq n \leq 100). This is followed by integers a_1, a_2, ..., a_n, each separated by a space, representing the number of stones in each pile (1 \leq a_i \leq 10^9).
For each test case, output one line. Print "FIRST" if the first player wins with perfect play, and "SECOND" if the second player wins.
Example 1