CF1239E.Turtle

Kolya has a turtle and a field of size $2 \times n$. The field rows are numbered from $1$ to $2$ from top to bottom, while the columns are numbered from $1$ to $n$ from left to right.

Suppose in each cell of the field there is a lettuce leaf. The energy value of lettuce leaf in row $i$ and column $j$ is equal to $a_{i,j}$. The turtle is initially in the top left cell and wants to reach the bottom right cell. The turtle can only move right and down and among all possible ways it will choose a way, maximizing the total energy value of lettuce leaves (in case there are several such paths, it will choose any of them).

Kolya is afraid, that if turtle will eat too much lettuce, it can be bad for its health. So he wants to reorder lettuce leaves in the field, so that the energetic cost of leaves eaten by turtle will be minimized.

科里亚有一只乌龟和一块大小为 $2 \times n$ 的田地。田地的行从上到下编号为 $1$ 到 $2$，列从左到右编号为 $1$ 到 $n$。

假设田地的每个格子中都有一片生菜叶。位于第 $i$ 行、第 $j$ 列的生菜叶的能量值为 $a_{i,j}$。乌龟初始时位于左上角格子，目标是到达右下角格子。乌龟只能向右或向下移动，并且在所有可能的路径中，它将选择一条使得所经过格子中生菜叶总能量值最大的路径（若存在多条这样的路径，则任选其一）。

科里亚担心乌龟吃太多生菜会对健康不利。因此，他希望重新排列田地中生菜叶的位置，使得乌龟所吃生菜叶的总能量值最小化。

The first line contains an integer $n$ ($2 \le n \le 25$) — the length of the field.

The second line contains $n$ integers $a_{1, i}$ ($0 \le a_{1, i} \le 50\,000$), the energetic cost of lettuce leaves in the first row of the field.

The third line contains $n$ integers $a_{2, i}$ ($0 \le a_{2, i} \le 50\,000$), the energetic cost of lettuce leaves in the second row of the field.

第一行包含一个整数 $n$（$2 \le n \le 25$）—— 表示田地的长度。

第二行包含 $n$ 个整数 $a_{1, i}$（$0 \le a_{1, i} \le 50\,000$），表示田地第一行生菜叶的能量消耗。

第三行包含 $n$ 个整数 $a_{2, i}$（$0 \le a_{2, i} \le 50\,000$），表示田地第二行生菜叶的能量消耗。

Print two lines with $n$ integers in each — the optimal reordering of lettuce from the input data.

In case there are several optimal ways to reorder lettuce, print any of them.

打印两行，每行包含 $n$ 个整数——即输入数据中生菜的最优重排结果。

若存在多种最优重排方式，输出任意一种即可。

In the first example, after reordering, the turtle will eat lettuce with total energetic cost $1+4+2 = 7$.

In the second example, the turtle will eat lettuce with energetic cost equal $0$.

In the third example, after reordering, the turtle will eat lettuce with total energetic cost equal $1$.

在第一个例子中，重新排序后，乌龟吃生菜的总能量消耗为 $1+4+2 = 7$。

在第二个例子中，乌龟吃生菜的能量消耗为 $0$。

在第三个例子中，重新排序后，乌龟吃生菜的总能量消耗为 $1$。