In this problem you should guess an array a which is unknown for you. The only information you have initially is the length $$$n$$$ of the array $$$a$$$.
The only allowed action is to ask the sum of two elements by their indices. Formally, you can print two indices $$$i$$$ and $$$j$$$ (the indices should be distinct). Then your program should read the response: the single integer equals to $$$a_i + a_j$$$.
It is easy to prove that it is always possible to guess the array using at most $$$n$$$ requests.
Write a program that will guess the array a by making at most $$$n$$$ requests.
The input starts with a line containing integer $$$n$$$ ($$$3 \leq n \leq 5000$$$) — the length of the array. Your program should read it at first.
After that your program should print to the standard output the requests about the sum of two elements or inform that the array is guessed.
Your program can do at most $$$n$$$ requests. Note that the final line «$$$!\, a_1\, a_2 \ldots a_n$$$» is not counted as a request.
Do not forget about flush operation after each printed line. To do this, use:
After you program prints the guessed array, it should terminate normally.
5 9 7 9 11 6
? 1 5 ? 2 3 ? 4 1 ? 5 2 ? 3 4 ! 4 6 1 5 5