Problem Statement

This is an interactive problem (a problem in which your program and the judge system communicate through input and output).
You are given a lowercase English letter $\alpha$. You play the following game against the judge system.

There is a blackboard on which strings can be written; initially, nothing is written on it.
Starting with the first player, the players alternately repeat the following operation. Here, let $S_i$ be the $i$-th string written on the blackboard.

• Write on the blackboard a string satisfying the following conditions. (Suppose that immediately before this operation, $n$ strings $(n \ge 0)$ $(S_1, S_2, \cdots, S_n)$ are written on the blackboard.)
• It consists only of lowercase English letters and has a length of exactly $2$.
• It is not equal to any of the strings currently written on the blackboard.
• The $1$st character of the string is
• $\alpha$ if $n = 0$.
• the $2$nd character of $S_n$ if $n \geq 1$.

The player who first becomes unable to perform the operation loses, and the other player wins.

You play this game as the first player. Play the game against the judge system and win in the minimum number of moves.
It can be proved that the first player has a winning strategy under optimal play.

Constraints

• $\alpha$ is a lowercase English letter.
• The string $T$ output by the system satisfies the conditions in the problem statement.

Input and Output

This is an interactive problem (a problem in which your program and the judge system communicate through input and output).

First, a lowercase English letter $\alpha$ is given from the input in the following format. Receive it.

$\alpha$

Then, the game starts immediately, with you as the first player and the judge system as the second player.
Let $m$ be the minimum number of operations required to win this game.
Interact with the judge system until the game ends, and win the game in at most $m$ operations.

When your turn comes, output the string $S$ to write on the blackboard in the following format.

? $S$

On the judge system's turn, one of the following strings is output.

• In any of the following cases, the judge system outputs in the format below.
  
  • You made an output that violates the output format or the conditions.
  • You have not yet won even after writing on the blackboard $m$ times.

  ! LOSE
  

  In this case, your answer is confirmed to be incorrect. Terminate immediately.


• If ! LOSE has not yet been output and there is no string the judge system can write on the blackboard, the judge system outputs in the following format.

  ! WIN
  

  In this case, you have won in the minimum number of moves. Your submission will be judged as AC if you terminate your program immediately.


• If there is a string that can be written on the blackboard, the judge system outputs the string $T$ to write on the blackboard in the following format.

? $T$

If the judge returns ! WIN or ! LOSE, the game has already ended. In this case, terminate your program immediately.

Notes

• Each time you produce output, append a newline at the end and flush standard output. Otherwise, the judge result may be TLE.
• If you produce invalid output during the interaction, or if your program terminates midway, the judge result is undefined.
  In particular, note that if a runtime error occurs during the execution of your program, the judge result may be WA or TLE instead of RE.
• Terminate your program immediately once the game ends. Otherwise, the judge result is undefined.

Sample