def solve(n, As):
    for i in range(1, 2 * n - 3):
        for p in range(i):
            q = i - p
            if q >= n:
                continue
            if p >= q:
                break
            if As[p] > As[q]:
                As[p], As[q] = As[q], As[p]
    return As

n = int(input())
As = list(map(int, input().split()))
print(*solve(n, As))