B'This is an interactive problem. Made in Heaven is a rather curious Stand. Of course, it is (arguably) the strongest Stand in existence, but it is also an ardent puzzle enjoyer. For example, it gave Qtaro the following problem recently: Made in Heaven has n hidden integers a_1, a_2, ... , a_n ( 3 <= n <= 5000 , 1 <= a_i <= 4 ). Qtaro must determine all the a_i by asking Made in Heaven some queries of the following form: By asking at most 5500 such questions, Qtaro must either tell Made in Heaven all the values of the a_i , or report that it is not possible to uniquely determine them. Unfortunately due to the universe reboot, Qtaro is not as smart as Jotaro. Please help Qtaro solve Made In Heaven 's problem. ^ dagger Three positive integers a, b, c are said to form the sides of a non-degenerate triangle if and only if all of the following three inequalities hold: The interaction begins with reading n ( 3 <= n <= 5000 ), the number of hidden integers. To ask a question corresponding to the triple (i, j, k) ( 1 <= q i < j < k <= q n ), output "? i j k " without quotes. Afterward, you should read a single integer s . If the numbers a_i cannot be uniquely determined print "! -1 " without quotes. On the other hand, if you have determined all the values of a_i print "! a_1 a_2 ... a_n " on a single line. The interactor is non-adaptive. The hidden array a_1, a_2, ... , a_n is fixed beforehand and is not changed during the interaction process. After printing a query do not forget to output the end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use: Hacks You can hack a solution with the following input format. The first line contains a single integer n ( 3 <= n <= 5000 ) -- the number of hidden integers. The second line contains n integers a_1, a_2, '...