You have 2n different numbers. Write a program to find all the ways to put the numbers in two rows x_{1} … x_{n} and y_{1} … y_{n} so that:
Input
Input consists of n, followed by 2n different integer numbers. Assume 1 ≤ n ≤ 11.
Output
Print all the ways to put the numbers fulfilling the required conditions. For every way, print three lines: two rows with x_{i} and y_{i} separated by spaces, and an empty line. Print the solutions in lexicographical order: first, those with the smaller x_{1}, in case of a tie, those with the smaller x_{2}, …, in case of a tie, those with the smaller x_{n}, in case of a tie, those with the smaller y_{1}, …
Input
3 1 2 3 4 5 6
Output
1 2 3 4 5 6 1 2 4 3 5 6 1 2 5 3 4 6 1 3 4 2 5 6 1 3 5 2 4 6
Input
1 0 -200
Output
-200 0