n = int(input())

S = list(map(int, input().split()))

c = 0

def merge(A, left, mid, right):
  inf = float('inf')
  L = A[left:mid] + [inf]
  R = A[mid:right] + [inf]
  i = 0
  j = 0
  global c
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      c += 1
    else:
      A[k] = R[j]
      j += 1
      c += 1

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

mergesort(S, 0, n)

print(" ".join(map(str, S)))

print(c) n = int(input()) n int(input()) int input() input S = list(map(int, input().split())) S list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split c = 0 c 0 def merge(A, left, mid, right):
  inf = float('inf')
  L = A[left:mid] + [inf]
  R = A[mid:right] + [inf]
  i = 0
  j = 0
  global c
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      c += 1
    else:
      A[k] = R[j]
      j += 1
      c += 1 merge inf = float('inf') inf float('inf') float 'inf' 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 i = 0 i 0 j = 0 j 0 global c for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      c += 1
    else:
      A[k] = R[j]
      j += 1
      c += 1 k range(left, right) range left right if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      c += 1
    else:
      A[k] = R[j]
      j += 1
      c += 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 c += 1 c 1 A[k] = R[j] A[k] A k R[j] R j j += 1 j 1 c += 1 c 1 A A left left mid mid right right def mergesort(A, left, right):
  if left+1 < right:
    mid = (left + right)//2
    mergesort(A, left, mid)
    mergesort(A, mid, right)    
    merge(A, left, mid, right) mergesort if left+1 < right:
    mid = (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 = (left + right)//2 mid (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 A A left left right right mergesort(S, 0, n) mergesort S 0 n print(" ".join(map(str, S))) print " ".join(map(str, S)) " ".join " " join map(str, S) map str S print(c) print c c = 0 0 c S = list(map(int, input().split())) list(map(int, input().split())) S def merge(A, left, mid, right):
  inf = float('inf')
  L = A[left:mid] + [inf]
  R = A[mid:right] + [inf]
  i = 0
  j = 0
  global c
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      c += 1
    else:
      A[k] = R[j]
      j += 1
      c += 1 def merge(A, left, mid, right):
  inf = float('inf')
  L = A[left:mid] + [inf]
  R = A[mid:right] + [inf]
  i = 0
  j = 0
  global c
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      c += 1
    else:
      A[k] = R[j]
      j += 1
      c += 1 merge def mergesort(A, left, right):
  if left+1 < right:
    mid = (left + right)//2
    mergesort(A, left, mid)
    mergesort(A, mid, right)    
    merge(A, left, mid, right) def mergesort(A, left, right):
  if left+1 < right:
    mid = (left + right)//2
    mergesort(A, left, mid)
    mergesort(A, mid, right)    
    merge(A, left, mid, right) mergesort n = int(input()) int(input()) n
n = int(input())

S = list(map(int, input().split()))

c = 0

def merge(A, left, mid, right):
  inf = float('inf')
  L = A[left:mid] + [inf]
  R = A[mid:right] + [inf]
  i = 0
  j = 0
  global c
  for k in range(left, right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i += 1
      c += 1
    else:
      A[k] = R[j]
      j += 1
      c += 1

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

mergesort(S, 0, n)

print(" ".join(map(str, S)))

print(c)
