n = int(input())
s = input().split()
l = []
for v in s:
    l.append(int(v))
ma = max(l)
mi = min(l)
# 遍历l列表,找出最大值和最小值的位置
for i in range(0, n):
    # 如果l[i]==ma(最大值),则与最后一个数l[n-1]交换位置
    if l[i] == ma:
        l[n - 1], l[i] = ma, l[n - 1]
    # 如果l[i]==ma(最小值),则与第一个数l[0]交换位置
    if l[i] == mi:
        l[0], l[i] = mi, l[0]
for i in range(0, n):
    print(l[i], end=' ')
/**************************************************************
	Problem: 1212
	User: admin
	Language: Python
	Result: Accepted
	Time:92 ms
	Memory:34480 kb
****************************************************************/