Problem Statement

In the year $20XX$, it became a hot topic that mixing certain $K$ types of energy drinks causes an explosion.
However, neither which specific $K$ types of energy drinks explode when mixed, nor the value of $K$, is known.
So the job given to $Iot$ is to identify the $K$ types of energy drinks.
Here there are $N$ types $(K\le N)$ of energy drinks, with an infinite number of bottles of each.
The energy drink types are numbered from $1$ to $N$. If even one of the specific $K$ types of energy drinks is not mixed in, there is no explosion.
Disregarding the amount required for an explosion, identify them on behalf of $Iot$.
However, you may ask the following question

• When energy drinks ${a_1,a_2...a_M}$ (where $a_i=1,2,...N$, any one of these values / $2\le M\le N$) are mixed, do they explode?

at most $1333$ times.

Input and Output

First, the number of types of energy drinks prepared, $N(3\le N\le 1000)$, is given from standard input as follows.

$N$

Then, your program may make up to $1333$ question queries to standard output in the following format.

$?\ M$
$a_1\ a_2\ ...a_M$

This output represents asking whether mixing the $M$ energy drinks ${a_1,a_2,...a_M}$ causes an explosion. $M$ must be an integer satisfying $2\le M\le N$.
Also, ${a_1,a_2,...a_M}$ must be sorted in ascending order and printed separated by spaces.
After you make a question query, its answer is given from standard input in the following format.

$ans$

If mixing the $M$ energy drinks causes an explosion, $ans=1$; if it does not, $ans=0$.
Finally, you must output the answer in the following format.

$!\ K$
$b_1\ b_2\ ...b_K$

First, $K$ represents the number of types of energy drinks that explode when mixed. Then, ${b_1,b_2,...b_K}$ represent the numbers of the energy drinks that explode when mixed.
They must be sorted in ascending order and printed separated by spaces.