CF347A.Difference Row

You want to arrange n integers _a_1, _a_2, ..., a__n in some order in a row. Let's define the value of an arrangement as the sum of differences between all pairs of adjacent integers.

More formally, let's denote some arrangement as a sequence of integers _x_1, _x_2, ..., x__n, where sequence x is a permutation of sequence a. The value of such an arrangement is (_x_1 - _x_2) + (_x_2 - _x_3) + ... + (x__n - 1 - x__n).

Find the largest possible value of an arrangement. Then, output the lexicographically smallest sequence x that corresponds to an arrangement of the largest possible value.

你想将 $ n $ 个整数 $ a_1, a_2, \dots, a_n $ 按某种顺序排成一行。我们定义一个排列的“值”为所有相邻整数对之差的总和。

更准确地说，设某个排列为整数序列 $ x_1, x_2, \dots, x_n $，其中序列 $ x $ 是序列 $ a $ 的一个排列。该排列的值为

$$(x_1 - x_2) + (x_2 - x_3) + \dots + (x_{n-1} - x_n).$$

求出可能的最大排列值；然后，输出字典序最小的、对应于该最大值的序列 $ x $。

The first line of the input contains integer n (2 ≤ n ≤ 100). The second line contains n space-separated integers _a_1, _a_2, ..., a__n (|a__i| ≤ 1000).

输入的第一行包含一个整数 $n$（$2 \leq n \leq 100$）。第二行包含 $n$ 个用空格分隔的整数 $a_1, a_2, \dots, a_n$（$|a_i| \leq 1000$）。

Print the required sequence _x_1, _x_2, ..., x__n. Sequence x should be the lexicographically smallest permutation of a that corresponds to an arrangement of the largest possible value.

输出所需的序列 $x_1,\,x_2,\,...,\,x_n$。序列 $x$ 应为数组 $a$ 的字典序最小的排列，且该排列所对应的安排具有最大可能的值。

In the sample test case, the value of the output arrangement is (100 - ( - 50)) + (( - 50) - 0) + (0 - 50) + (50 - ( - 100)) = 200. No other arrangement has a larger value, and among all arrangements with the value of 200, the output arrangement is the lexicographically smallest one.

Sequence _x_1, _x_2, ... , x__p is lexicographically smaller than sequence _y_1, _y_2, ... , y__p if there exists an integer r (0 ≤ r < p) such that _x_1 = _y_1, _x_2 = _y_2, ... , x__r = y__r and x__r + 1 < y__r + 1.

在样例测试用例中，输出排列的值为 $(100 - ( - 50)) + (( - 50) - 0) + (0 - 50) + (50 - ( - 100)) = 200$。不存在其他排列具有更大的值；而在所有值为 $200$ 的排列中，输出排列是字典序最小的一个。

序列 $x_1, x_2, \ldots, x_p$ 字典序小于序列 $y_1, y_2, \ldots, y_p$，当且仅当存在整数 $r$（满足 $0 \le r < p$），使得 $x_1 = y_1,\, x_2 = y_2,\, \ldots,\, x_r = y_r$，且 $x_{r+1} < y_{r+1}$。