B'This is an interactive problem. Consider the following game for two players: It can be shown that game always ends after the finite number of rounds. You have to select which player you will play for (first or second) and win the game. The first line contains a single integer n ( 1 <= n <= 300 ) -- the length of array a . The second line contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 300 ) -- array a . Interaction begins after reading n and array a . You should start interaction by printing a single line, containing either "First" or "Second", representing the player you select. On each round, the following happens: If j = -1 , then you made an incorrect move. In this case your program should terminate immediately. If j = 0 , then the second player can 't make a correct move and you win the game. In this case your program should also terminate immediately. Otherwise j is equal to the index chosen by the second player, and you should proceed to the next round. If i = -1 , then you made an incorrect move on the previous round (this cannot happen on the first round). In that case your program should terminate immediately. If i = 0 , then the first player can 't make a correct move and you win the game. In this case your program should also terminate immediately. Otherwise i is equal to the index chosen by first player. In this case you should write single integer j ( 1 <= j <= n ) on a separate line and proceed to the next round. After printing i or j , do not forget to output the end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use: Hacks Hacks are disabled in this problem. In the first example n = 4 and array a is [ , 10, 4, 6, 3 ,] . The game goes as follows: In the second example n = 6 and array a is [ , 4, 5, 5, 11, 3, 2 ,] . The game goes as follows: Note'...