{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n h1 { font-size: 1.2em; }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\n\u003cdiv class\u003d\"md\"\u003e\u003cp\u003eThere are \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e heaps of sticks and two players who move alternately. On each move, a player chooses a non-empty heap and removes \u003cspan class\u003d\"math inline\"\u003e$ 1 $\u003c/span\u003e, \u003cspan class\u003d\"math inline\"\u003e$ 2 $\u003c/span\u003e, or \u003cspan class\u003d\"math inline\"\u003e$ 3 $\u003c/span\u003e sticks. The player who removes the last stick wins the game.\u003c/p\u003e\n\u003cp\u003eYour task is to find out who wins if both players play optimally.\u003c/p\u003e\n\u003ch1 id\u003d\"input\"\u003eInput\u003c/h1\u003e\n\u003cp\u003eThe first input line contains an integer \u003cspan class\u003d\"math inline\"\u003e$ t $\u003c/span\u003e: the number of tests. After this, \u003cspan class\u003d\"math inline\"\u003e$ t $\u003c/span\u003e test cases are described:\u003c/p\u003e\n\u003cp\u003eThe first line contains an integer \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e: the number of heaps.\u003c/p\u003e\n\u003cp\u003eThe next line has \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e integers \u003cspan class\u003d\"math inline\"\u003e$ x_1,x_2,\\ldots,x_n $\u003c/span\u003e: the number of sticks in each heap.\u003c/p\u003e\n\u003ch1 id\u003d\"output\"\u003eOutput\u003c/h1\u003e\n\u003cp\u003eFor each test case, print \"first\" if the first player wins the game and \"second\" if the second player wins the game.\u003c/p\u003e\n\u003ch1 id\u003d\"constraints\"\u003eConstraints\u003c/h1\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le t \\le 2 \\cdot 10^5 $\u003c/span\u003e\u003c/li\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le n \\le 2 \\cdot 10^5 $\u003c/span\u003e\u003c/li\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le x_i \\le 10^9 $\u003c/span\u003e\u003c/li\u003e\n\u003cli\u003ethe sum of all \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e is at most \u003cspan class\u003d\"math inline\"\u003e$ 2 \\cdot 10^5 $\u003c/span\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch1 id\u003d\"example\"\u003eExample\u003c/h1\u003e\n\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\n4\n5 7 2 5\n2\n4 1\n3\n4 4 4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003efirst\nfirst\nsecond\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e "}}]}