n = int(input())
a = list(map(int, input().split()))
INF = 1000000000
count = 0
def merge(A, left, mid, right):
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  global count
  i, j = 0, 0
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      count += 1
    else:
      A[k] = R[j]
      j += 1
      count += 1

def mergeSort(A, left, right):
  if left + 1 < right:
    mid = int((left+right)/2)
    mergeSort(A, left, mid)
    mergeSort(A, mid, right)
    merge(A, left, mid, right)
  return

mergeSort(a, 0, n)
print(*a)
print(count) n = int(input()) n int(input()) int input() input a = list(map(int, input().split())) a list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split INF = 1000000000 INF 1000000000 count = 0 count 0 def merge(A, left, mid, right):
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  global count
  i, j = 0, 0
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      count += 1
    else:
      A[k] = R[j]
      j += 1
      count += 1 merge L = A[left:mid] + [INF] L A[left:mid] + [INF] A[left:mid] A left:mid left mid [INF] INF R = A[mid:right] + [INF] R A[mid:right] + [INF] A[mid:right] A mid:right mid right [INF] INF global count i, j = 0, 0 i 0 j 0 for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      count += 1
    else:
      A[k] = R[j]
      j += 1
      count += 1 k range(left, right) range left right if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      count += 1
    else:
      A[k] = R[j]
      j += 1
      count += 1 L[i] <= R[j] L[i] L i R[j] R j A[k] = L[i] A[k] A k L[i] L i i += 1 i 1 count += 1 count 1 A[k] = R[j] A[k] A k R[j] R j j += 1 j 1 count += 1 count 1 A A left left mid mid right right def mergeSort(A, left, right):
  if left + 1 < right:
    mid = int((left+right)/2)
    mergeSort(A, left, mid)
    mergeSort(A, mid, right)
    merge(A, left, mid, right)
  return mergeSort if left + 1 < right:
    mid = int((left+right)/2)
    mergeSort(A, left, mid)
    mergeSort(A, mid, right)
    merge(A, left, mid, right)
   left + 1 < right left + 1 left 1 right mid = int((left+right)/2) mid int((left+right)/2) int (left+right)/2 left+right left right 2 mergeSort(A, left, mid) mergeSort A left mid mergeSort(A, mid, right) mergeSort A mid right merge(A, left, mid, right) merge A left mid right return A A left left right right mergeSort(a, 0, n) mergeSort a 0 n print(*a) print *a a print(count) print count n = int(input()) int(input()) n INF = 1000000000 1000000000 INF count = 0 0 count a = list(map(int, input().split())) list(map(int, input().split())) a def mergeSort(A, left, right):
  if left + 1 < right:
    mid = int((left+right)/2)
    mergeSort(A, left, mid)
    mergeSort(A, mid, right)
    merge(A, left, mid, right)
  return def mergeSort(A, left, right):
  if left + 1 < right:
    mid = int((left+right)/2)
    mergeSort(A, left, mid)
    mergeSort(A, mid, right)
    merge(A, left, mid, right)
  return mergeSort def merge(A, left, mid, right):
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  global count
  i, j = 0, 0
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      count += 1
    else:
      A[k] = R[j]
      j += 1
      count += 1 def merge(A, left, mid, right):
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  global count
  i, j = 0, 0
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      count += 1
    else:
      A[k] = R[j]
      j += 1
      count += 1 merge
n = int(input())
a = list(map(int, input().split()))
INF = 1000000000
count = 0
def merge(A, left, mid, right):
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  global count
  i, j = 0, 0
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      count += 1
    else:
      A[k] = R[j]
      j += 1
      count += 1

def mergeSort(A, left, right):
  if left + 1 < right:
    mid = int((left+right)/2)
    mergeSort(A, left, mid)
    mergeSort(A, mid, right)
    merge(A, left, mid, right)
  return

mergeSort(a, 0, n)
print(*a)
print(count)
