There is a hidden integer $$$1 \le n \le 10^4$$$. You may ask questions in the form "Is $$$n$$$ divisible by $$$x$$$?" for some integer $$$1 \le x \le 10^4$$$.

Your goal is to determine the value of $$$n$$$ by asking at most 1500 questions.

To ask a question, print a line in the form "$$$\texttt{?}\ x$$$" ($$$1 \le x \le 10^4$$$). After that, you should read a line containing a string "Yes" or "No" denoting the answer to the question.

When you have determined the value of $$$n$$$, print the answer in the format "$$$\texttt{!}\ n$$$".

Remember to flush the output after printing a line.

The interactor is not adaptive, which means that the value $$$n$$$ is fixed beforehand and doesn't change during interaction.