B'This is an interactive problem. This is the game version of the problem. Note that the solution of this problem may or may not share ideas with the solution of the solo version. You can solve and get points for both versions independently. Alice and Bob are playing a game. The game starts with a positive integer n , with players taking turns. On each turn of the game, the following sequence of events takes place: As Alice, your goal is to win. You can execute a maximum of 63 break operations. You have the choice to play first or second. The system will act for Bob. Here oplus denotes the bitwise XOR operation. Each test contains multiple test cases. The first line of input contains a single integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. The only line of each test case contains a single integer n ( 1 <= q n <= q 10^{18} ) -- the number the game starts with. For each test case, the interaction begins by reading the integer n . After reading n , print a single line containing either "first" or "second", denoting what you want to play as (as first or second correspondingly). On Alice 's turn, you are required to print two positive integers, p_{1} and p_{2} such that 0 lt p_{1} lt p , 0 lt p_{2} lt p and p_{1} oplus p_{2} = p . Here, p equals one of the two integers printed by Bob in the previous turn. If no turn has occurred previously, p is equal to n . If Alice cannot perform a break operation, print "0 0" to receive a Wrong answer verdict. On Bob 's turn, you should read two integers, p_{1} and p_{2} such that 0 lt p_{1} lt p , 0 lt p_{2} lt p and p_{1} oplus p_{2} = p . Here, p equals one of the two integers printed by Alice in the previous turn. If no turn has occurred previously, p is equal to n . If Bob cannot perform a break operation p_{1} = 0 and p_2 = 0 in which case you shou'...