시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 512 MB 49 8 8 16.327%

문제

You found a box with old games when cleaning up your attic, and among them was also a jigsaw puzzle. Unfortunately, the packaging was damaged, so a couple of puzzle pieces are scattered around the bottom of the box, and you suspect that some of the pieces may have been lost elsewhere. In fact, given the orderliness of your attic, some of the pieces in the box may even come from some entirely different puzzle! So now you have a pile of puzzle pieces lying in front of you and you are trying to assemble them into a solved puzzle.

Figure J.1: Illustration of the first sample.

More formally:

  • There are n square-shaped pieces, numbered from 1 to n, which need to be arranged side by side to form a single rectangle. All n pieces have to be used.
  • The edges of the pieces are either straight or irregular. Straight edges must be placed on the boundary of the assembled rectangle and irregular edges must be placed on the inside.
  • The irregular edges are all shaped differently, so that each edge shape occurs exactly two times, on two different puzzle pieces. Two pieces can only be placed next to each other if the shapes of the corresponding edges match.
  • You may rotate the pieces, but you may not flip them over.

입력

The input consists of:

  • one line with one integer n (1 ≤ n ≤ 3 · 105), the number of pieces;
  • n lines, each with four integers, the i-th line gives the connections (edge shapes) of the i-th piece in counter-clockwise order.

A connection of type 0 stands for a straight edge. The other connection types are numbered with consecutive positive integers starting from 1 and each of them occurs exactly two times, on two different lines.

출력

If the pieces cannot be assembled as described above, output impossible. Otherwise, output the solved puzzle in the following format:

  • one line with two integers h, w (h, w ≥ 1, h · w = n), the height and width of the grid;
  • h lines, each with w integers, the numbers of the pieces.

Any rotation of the correct solution will by accepted.

예제 입력 1

6
0 0 1 6
0 7 4 0
0 0 2 1
5 3 0 6
3 7 0 0
4 5 2 0

예제 출력 1

2 3
1 4 5
3 6 2

예제 입력 2

4
0 0 1 2
0 0 2 3
0 0 3 4
0 0 1 4

예제 출력 2

impossible