B'It turns out that the meaning of life is a permutation p_1, p_2, ldots, p_n of the integers 1, 2, ldots, n ( 2 <= q n <= q 100 ). Omkar, having created all life, knows this permutation, and will allow you to figure it out using some queries. A query consists of an array a_1, a_2, ldots, a_n of integers between 1 and n . a is not required to be a permutation. Omkar will first compute the pairwise sum of a and p , meaning that he will compute an array s where s_j = p_j + a_j for all j = 1, 2, ldots, n . Then, he will find the smallest index k such that s_k occurs more than once in s , and answer with k . If there is no such index k , then he will answer with 0 . You can perform at most 2n queries. Figure out the meaning of life p . Start the interaction by reading single integer n ( 2 <= q n <= q 100 ) -- the length of the permutation p . You can then make queries. A query consists of a single line " ? enspace a_1 enspace a_2 enspace ldots enspace a_n " ( 1 <= q a_j <= q n ). The answer to each query will be a single integer k as described above ( 0 <= q k <= q n ). After making a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use: To output your answer, print a single line " ! enspace p_1 enspace p_2 enspace ldots enspace p_n " then terminate. You can make at most 2n queries. Outputting the answer does not count as a query. Hack Format To hack, first output a line containing n ( 2 <= q n <= q 100 ), then output another line containing the hidden permutation p_1, p_2, ldots, p_n of numbers from 1 to n . In the sample, the hidden permutation p is [3, 2, 1, 5, 4] . Three queries were made. The first query is a = [4, 4, 2, 3, 2] . This yields s = [3 + 4, 2 + 4, 1 + 2, 5 +'...