B'Ray lost his array and needs to find it by asking Omkar. Omkar is willing to disclose that the array has the following qualities: Ray is allowed to send Omkar a series of queries. A query consists of two integers, l and r such that 1 <= l <= r <= n . Omkar will respond with two integers, x and f . x is the mode of the subarray from index l to index r inclusive. The mode of an array is defined by the number that appears the most frequently. If there are multiple numbers that appear the most number of times, the smallest such number is considered to be the mode. f is the amount of times that x appears in the queried subarray. The array has k ( 1 <= k <= min(25000,n) ) distinct elements. However, due to Ray 's sins, Omkar will not tell Ray what k is. Ray is allowed to send at most 4k queries. Help Ray find his lost array. The only line of the input contains a single integer n ( 1 <= n <= 2 cdot 10^5 ), which equals to the length of the array that you are trying to find. The interaction starts with reading n . Then you can make one type of query: The answer to each query will be in the form " x enspace f " where x is the mode of the subarray and f is the number of times x appears in the subarray. To output your answer, print: And quit after that. This query is not counted towards the 4k queries limit. After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use: Hack Format To hack, output 1 integer on the first line, n ( 1 <= n <= 2 cdot 10^5 ). On the second line output n integers a_1, a_2, ldots, a_{n-1}, a_n separated by a space such that there are at most 25000 distinct numbers and a_j <= a_{j+1} for all j from 1 to n-1 . The first query is l=1 and r=6 . The mode is 2'...