This is an interactive problem. In the interaction section below you will see the information about flushing the output. In this problem, you will be playing a game with Hongcow. How lucky of you! Hongcow has a hidden n by n matrix M . Let M i , j denote the entry i -th row and j -th column of the matrix. The rows and columns are labeled from 1 to n . The matrix entries are between 0 and 10 9 . In addition, M i , i = 0 for all valid i . Your task is to find the minimum value along each row, excluding diagonal elements. Formally, for each i , you must find . To do this, you can ask Hongcow some questions. A question consists of giving Hongcow a subset of distinct indices { w 1 , w 2 , ..., w k } , with 1 ≤ k ≤ n . Hongcow will respond with n integers. The i -th integer will contain the minimum value of min 1 ≤ j ≤ k M i , w j . You may only ask Hongcow at most 20 questions — he thinks you only need that many questions answered. When you are ready to answer, print out a single integer - 1 on its own line, then n integers on the next line. The i -th integer should be the minimum value in the i -th row of the matrix, excluding the i -th element. Do not forget to flush the final answer as well. Printing the answer does not count as asking a question. You will get Wrong Answer verdict if Your question or answers are not in the format described in this statement. You ask strictly more than 20 questions. Your question contains duplicate indices. The value of k in your question does not lie in the range from 1 to n , inclusive. Your final answer is not correct. The first line of input will contain a single integer n ( 2 ≤ n ≤ 1, 000 ). To print the final answer, print out the string -1 on its own line. Then, the next line should contain n integers. The i -th integer should be the minimum value of the i -th row of the matrix, excluding elements on the diagonal. Do not forget to flush your answer! To ask a question, print out a single integer k on its own line, denot