B'It is an interactive problem. Vasya enjoys solving quizzes. He found a strange device and wants to know how it works. This device encrypted with the tree (connected undirected graph without cycles) with n vertices, numbered with integers from 1 to n . To solve this quiz you should guess this tree. Fortunately, this device can make one operation, using which you should guess the cipher. You can give the device an array d_1, d_2, ldots, d_n of non-negative integers. On the device, there are n lamps, i -th of them is connected with i -th vertex of the tree. For all i the light will turn on the i -th lamp, if there exist such vertex of the tree with number j neq i that dist(i, j) <= q d_j . Let 's define dist(i, j) as the distance between vertices i and j in tree or number of edges on the simple path between vertices i and j . Vasya wants to solve this quiz using <= q 80 operations with the device and guess the tree. Help him! In the beginning, your program should read one integer n -- the number of vertices of the tree which encrypts the device ( 2 <= q n <= q 1000 ). After that, you can make several operations in the following format. To do operation print a symbol"?" (without quotes) and n integers d_1, d_2, ldots, d_n , separated by spaces after it. Please note, that for all i you can only use the numbers, satisfying the inequality 0 <= q d_i < n . After that, you should read a string s with length n , consisting of symbols "0" and "1" (without quotes). For all i the symbol s_i is equal to "0", if the lamp on the device, connected with i -th vertex of the tree is switched off and "1" otherwise. After several operations, you should print guessed tree. To do it print the only symbol "!" (without quotes). In the next n-1 lines print 2 integers a_i , b_i -- indexes of the verti'...