Gods

At a feast in Asgard, the gods talked to each other. Under the influence of mead, they quarreled. A fight was about to break out, and the gods realized they wanted to fight only the ones they had argued with, and did not want to quarrel with any other god.

Odin, the cleverest god in Asgard, saw that it would be very convenient if the gods stood in two lines facing each other, so that no two gods who had quarreled were in the same line. Thor developed his father's idea and introduced the concept of an 'attack line'. An attack line is the segment connecting the positions of two gods who quarreled. Thor further proposed that it would be even more convenient if the attack lines of different gods did not intersect, because then the gods themselves would certainly not cross paths during the battle. All the gods approved. Only the positions remain to be taken, and then the fight can begin.

As an honored citizen of Midgard, you have the chance to help the gods. Write a program that splits the gods into two lines so that Thor's refinement holds.

The first line contains $n$ ($1 \le n \le 10^5$), the number of gods in Asgard. Each of the next $n$ lines contains $k_i + 1$ integers. The first integer is $k_i$ ($1 \le k_i \le n$), the number of gods who quarreled with god $i$, followed by the numbers of those gods. If god $i$ quarreled with god $j$, then god $j$ quarreled with god $i$. The sum of all $k_i$ does not exceed $4 \times n$.

If a solution exists, print two numbers $m$ and $k$ on the first line: the number of gods in the first line and the number of gods in the second line. On the next two lines, print the numbers of the gods in the first and second lines, from left to right. Otherwise, print $-1$.