When they are bored, Federico and Giada often play the following card game with a deck containing $6n$ cards.

Each card contains one number between $1$ and $6n$ and each number appears on exactly one card. Initially the deck is sorted, so the first card contains the number $1$, the second card contains the number $2$, $\dots$, and the last one contains the number $6n$.

Federico and Giada take turns, alternating; Federico starts.

In his turn, the player takes $3$ contiguous cards from the deck and puts them in his pocket. The order of the cards remaining in the deck is not changed. They play until the deck is empty (after exactly $2n$ turns). At the end of the game both Federico and Giada have $3n$ cards in their pockets.

You are given the cards in Federico's pocket at the end of the game. Describe a sequence of moves that produces that set of cards in Federico's pocket.

The first line of the input contains one integer $n$ ($1\le n \le 200$).

The second line of the input contains $3n$ numbers $x_1, x_2,\ldots, x_{3n}$ ($1 \le x_1 < x_2 <\ldots < x_{3n} \le 6n$) – the cards in Federico's pocket at the end of the game.

It is guaranteed that for each test there is at least one sequence of moves that produces such set of cards in Federico's pocket.

Print $2n$ lines, each containing $3$ integers.

The $i$-th line should contain, in increasing order, the integers $a_i<b_i<c_i$ written on the three cards taken by the player during the $i$-th turn (so taken by Federico if $i$ is odd and by Giada if $i$ is even).

If there is more than one possible sequence of moves, you can print any.