Suppose there are n students in CS203 DSAA, the height of each student is \(a_i (1 \leq i \leq n)\). You are asked to arrange these students to the seats (i.e., \(b_1, b_2, …, b_n\)) in a round table such that the minimum value, denoted by \(k\), of the medium height of every three students in consecutive seats (i.e., \(b_i\), \(b_{i\bmod n + 1}\), \(b_{(i + 1)\bmod n + 1}\)) is maximized.

Please print \(k\) and the height of the student in seats \(b_1, b_2, …, b_n\).

If it has more than one possible solution, print the height of the student in seats \(b_1, b_2, …, b_n\) with smallest lexicographical order.