|Author:||A. Usmanov||Time limit:||1 sec|
|Input / output:||interactive||Memory limit:||256 Mb|
This is an interactive problem. You will interact with a server by sending and receiving particular messages.
You are given a complete binary tree of height N having maximum possible number of nodes.
Nodes are numbered from 1 to 2N − 1.
Your task is to determine the number of root. You can perform requests to find least common ancestor (LCA) of any two nodes to achieve this. You are allowed to perform no more than N requests.
The first line contains one integer N — height of the tree.
To make a request print a line "
? X Y",
where X and Y — are integer numbers of nodes.
After such a request you receive one integer —
the number of least common ancestor of these two nodes.
When your program determines the root of the given tree, it should print "
! X" and immediately stop.
If your program makes incorrect query, it will receive "Presentation error" verdict. If your program exceeds allowed number of queries, it will receive "Wrong answer" verdict.
Every query and final output must be a single line ending with single end-of-line (
Output buffers must be flushed after every line:
1 ≤ N ≤ 10
1 ≤ X, Y < 2N
The first sample contains the next tree:
|No.||Standard input||Standard output|