import sys
input = sys.stdin.readline

if __name__ == '__main__':
  n = int(input())
  A = list(map(int, input().split()))
  cnt = 0

  def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L=[10**9+1]*(n1+1) # 先に入れきった方の配列をヌルポにしないため
    R=[10**9+1]*(n2+1)
    for i in range(n1):
      L[i] = A[left + i]
    for i in range(n2):
      R[i] = A[mid + i]
    i = 0
    j = 0
    for k in range(left, right):
      cnt += 1
      if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 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(A, 0, n)
  print(*A)
  print(cnt)

 import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline if __name__ == '__main__':
  n = int(input())
  A = list(map(int, input().split()))
  cnt = 0

  def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L=[10**9+1]*(n1+1) # 先に入れきった方の配列をヌルポにしないため
    R=[10**9+1]*(n2+1)
    for i in range(n1):
      L[i] = A[left + i]
    for i in range(n2):
      R[i] = A[mid + i]
    i = 0
    j = 0
    for k in range(left, right):
      cnt += 1
      if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 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(A, 0, n)
  print(*A)
  print(cnt) __name__ == '__main__' __name__ '__main__' 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 cnt = 0 cnt 0 def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L=[10**9+1]*(n1+1) # 先に入れきった方の配列をヌルポにしないため
    R=[10**9+1]*(n2+1)
    for i in range(n1):
      L[i] = A[left + i]
    for i in range(n2):
      R[i] = A[mid + i]
    i = 0
    j = 0
    for k in range(left, right):
      cnt += 1
      if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 1

   merge global cnt n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L=[10**9+1]*(n1+1) L [10**9+1]*(n1+1) [10**9+1] 10**9+1 10**9 10 9 1 n1+1 n1 1 R=[10**9+1]*(n2+1) R [10**9+1]*(n2+1) [10**9+1] 10**9+1 10**9 10 9 1 n2+1 n2 1 for i in range(n1):
      L[i] = A[left + i]
     i range(n1) range n1 L[i] = A[left + i] L[i] L i A[left + i] A left + i left i for i in range(n2):
      R[i] = A[mid + i]
     i range(n2) range n2 R[i] = A[mid + i] R[i] R i A[mid + i] A mid + i mid i i = 0 i 0 j = 0 j 0 for k in range(left, right):
      cnt += 1
      if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 1

   k range(left, right) range left right cnt += 1 cnt 1 if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 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 A[k] = R[j] A[k] A k R[j] R j j += 1 j 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(A, 0, n) mergeSort A 0 n print(*A) print *A A print(cnt) print cnt n = int(input()) int(input()) n 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 A = list(map(int, input().split())) list(map(int, input().split())) A input = sys.stdin.readline sys.stdin.readline input def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L=[10**9+1]*(n1+1) # 先に入れきった方の配列をヌルポにしないため
    R=[10**9+1]*(n2+1)
    for i in range(n1):
      L[i] = A[left + i]
    for i in range(n2):
      R[i] = A[mid + i]
    i = 0
    j = 0
    for k in range(left, right):
      cnt += 1
      if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 1

   def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L=[10**9+1]*(n1+1) # 先に入れきった方の配列をヌルポにしないため
    R=[10**9+1]*(n2+1)
    for i in range(n1):
      L[i] = A[left + i]
    for i in range(n2):
      R[i] = A[mid + i]
    i = 0
    j = 0
    for k in range(left, right):
      cnt += 1
      if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 1

   merge cnt = 0 0 cnt
import sys
input = sys.stdin.readline

if __name__ == '__main__':
  n = int(input())
  A = list(map(int, input().split()))
  cnt = 0

  def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L=[10**9+1]*(n1+1) # 先に入れきった方の配列をヌルポにしないため
    R=[10**9+1]*(n2+1)
    for i in range(n1):
      L[i] = A[left + i]
    for i in range(n2):
      R[i] = A[mid + i]
    i = 0
    j = 0
    for k in range(left, right):
      cnt += 1
      if L[i] <= R[j]:
        A[k] = L[i]
        i += 1
      else:
        A[k] = R[j]
        j += 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(A, 0, n)
  print(*A)
  print(cnt)


