Problem Statement

This is an interactive problem.

sounansya has a permutation $P=(P_1,\ldots,P_N)$ of length $N$, obtained by rearranging the positive integers between $1$ and $N$, inclusive.
You may ask the following question up to $N-1$ times:

Choose a pair of integers $(l,r)$ satisfying $1\le l< r\le N$, and ask for the value of $\displaystyle \sum_{i=l}^r P_i$.

Guess the permutation that sounansya has.

Constraints

All inputs are integers.

$3\le N\le 1000$

Input and Output

This is an interactive problem (a problem in which your program and the judge program interact through input and output).
First, read the length $N$ of the permutation from standard input.

$N$

Then, repeat questions until you can determine the permutation.
Print each question to standard output in the following format.

$?$ $l$ $r$

The response to this is given from standard input in the following format.

$S$

Here, $S$ is the answer to the question.
Once you have determined the permutation, print it to standard output in the following format.

$!$ $P_1$ $\ldots$ $P_N$

Notes

Each time you print something, end it with a newline and flush standard output. Otherwise, the judge result may be TLE.

If you print invalid output during the interaction, the judge result is undefined.

Terminate your program immediately after answering with the permutation. Otherwise, the judge result is undefined.

The query that gives the answer is not counted toward the number of questions.

Sample