Envío 1505

Código

def merge_sort(a):
  n = len(a)
  if n == 1:
    return a
  half = int(n/2)
  left = merge_sort(a[0:half])
  right = merge_sort(a[half:])
  a = []

  l, r = 0, 0
  while l < len(left) and r < len(right):
    if left[l] < right[r]:
      a.append(left[l])
      l += 1
    else:
      a.append(right[r])
      r += 1
  a.extend(left[l:])
  a.extend(right[r:])

  return a

n = input()
a = merge_sort(list(map(int, input().split())))
print(*a, sep=" ")