Problem I. Implicit array ≡

Statement

Sorted array of integers is represented implicitly. Instead of each element, a set of that element and its neighbors on the right and on the left is known. First and last array elements have no more than one neighbor. Note that the set does not represent neither the order of elements nor duplicate values.

Your program must output explicit representation of the array (all elements in order).

Input file format

First line of input file contains integer N — number of elements in array.

Following N lines contain implicit representation of array elements: set size s_i and s_i different integers a_ij — a set of i-th array element and its neighbors.

Output file format

Output file must contain N integers — elements of original sorted array.

Constraints

1 ≤ N ≤ 10⁵

 − 10⁹ ≤ a_ij ≤ 10⁹

Sample tests

7
1 1
1 1
2 1 2
2 1 2
2 2 3
2 2 3
1 3

1 1 1 2 2 3 3

1
1 7

7