B'Since Sonya has just learned the basics of matrices, she decided to play with them a little bit. Sonya imagined a new type of matrices that she called rhombic matrices. These matrices have exactly one zero, while all other cells have the Manhattan distance to the cell containing the zero. The cells with equal numbers have the form of a rhombus, that is why Sonya called this type so. The Manhattan distance between two cells ( x_1 , y_1 ) and ( x_2 , y_2 ) is defined as |x_1 - x_2| + |y_1 - y_2| . For example, the Manhattan distance between the cells (5, 2) and (7, 1) equals to |5-7|+|2-1|=3 . Note that rhombic matrices are uniquely defined by n , m , and the coordinates of the cell containing the zero. She drew a n x m rhombic matrix. She believes that you can not recreate the matrix if she gives you only the elements of this matrix in some arbitrary order (i.e., the sequence of n cdot m numbers). Note that Sonya will not give you n and m , so only the sequence of numbers in this matrix will be at your disposal. Write a program that finds such an n x m rhombic matrix whose elements are the same as the elements in the sequence in some order. The first line contains a single integer t ( 1 <= q t <= q 10^6 ) -- the number of cells in the matrix. The second line contains t integers a_1, a_2, ldots, a_t ( 0 <= q a_i< t ) -- the values in the cells in arbitrary order. In the first line, print two positive integers n and m ( n x m = t ) -- the size of the matrix. In the second line, print two integers x and y ( 1 <= q x <= q n , 1 <= q y <= q m ) -- the row number and the column number where the cell with 0 is located. If there are multiple possible answers, print any of them. If there is no solution, print the single integer -1 . You can see the solution to the first example in the legend. You also'...