B"This is an interactive problem. Vasya and Vitya play a game. Vasya thought of two integers a and b from 1 to n and Vitya tries to guess them. Each round he tells Vasya two numbers x and y from 1 to n . If both x=a and y=b then Vitya wins. Else Vasya must say one of the three phrases: Vasya can't lie, but if multiple phrases are true, he may choose any of them. For example, if Vasya thought of numbers 2 and 4 , then he answers with the phrase 3 to a query (3, 4) , and he can answer with the phrase 1 or phrase 3 to a query (1, 5) . Help Vitya win in no more than 600 rounds. The first line contains a single integer n ( 1 <= q n <= q 10^{18} ) -- the upper limit of the numbers. First, you need to read the number n , after that you can make queries. To make a query, print two integers: x and y ( 1 <= q x, y <= q n ), then flush the output. After each query, read a single integer ans ( 0 <= q ans <= q 3 ). If ans > 0 , then it is the number of the phrase said by Vasya. If ans = 0 , it means that you win and your program should terminate. If you make more than 600 queries or make an incorrect query, you will get Wrong Answer. Your solution will get Idleness Limit Exceeded, if you don't print anything or forget to flush the output. To flush you need to do the following right after printing a query and a line end: Hacks format For hacks, use the following format: In the first line, print a single integer n ( 1 <= q n <= q 10^{18} ) -- the upper limit of the numbers. In the second line, print two integers a and b ( 1 <= q a, b <= q n ) -- the numbers which Vasya thought of. In the third line, print a single integer m ( 1 <= q m <= q 10^5 ) -- the number of instructions for the interactor. In each of the next m lines, print five integers: x_i , y_i$"...