Variation of NIM
On the table, there are n 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 n-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.
Input
The first line contains an integer t — the number of test cases (1 ≤ t ≤ 100). Each of the following t lines describes a test case. Each line begins with an integer n — the number of piles (1 ≤ n ≤ 100). This is followed by n integers a_1, a_2, ..., a_n, each separated by a space, representing the number of stones in each pile (1 ≤ a_i ≤ 10^9).
Output
For each test case, output one line. Print "FIRST" if the first player wins with perfect play, and "SECOND" if the second player wins.