2021_GDUT_新生专题训练_dfs/bfs+二分

G - MaratonIME gets candies

Obs: this is an interactive problem. More information is under the "Interaction" section.

MaratonIME is gathering to start another group practice. This time, Renzo decided to reward the students with candies as they solve problems. Curious as they are, the members of MaratonIME started to guess how many candies did Renzo bring. For each question, Renzo answered if the amount of candies was higher, lower or equal to the number asked.

Breno, noticing that the amount of candies could be very high, decided to limit the number of queries to 50. This way, the practice would start as soon as possible.

Renzo bought at least 1 and no more than 109 candies. Find how many candies were bought by Renzo with no more than 50 questions.

Input

For every question asked, read a character. It will be " > " if the amount of Renzo's candies is higher than your guess, " < " if the amount of Renzo's candies is lower than your guess or " = " if your guess is equal to the amount of Renzo's candies.

Output

You must print every query in the format "Q y", where y is the number guessed, and 1 ≤ y ≤ 109. After printing a question, you need to flush the output. Check the "Interaction" section for examples of how to