"""
マージソート
分割統治法に基づく高速なアルゴリズム。
merge(A, left, mid, right)
  n1 = mid - left;
  n2 = right - mid;
  L[0...n1], R[0...n2] を生成
  for i = 0 to n1-1
    L[i] = A[left + i]
  for i = 0 to n2-1
    R[i] = A[mid + i]
  L[n1] = INFTY
  R[n2] = INFTY
  i = 0
  j = 0
  for k = left to right-1
    if L[i] <= R[j]
      A[k] = L[i]
      i = i + 1
    else 
      A[k] = R[j]
      j = j + 1

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 merge(A,left,mid,right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:left+n1] + [10**9+7]
    R = A[mid:mid+n2] + [10**9+7]
    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)

n = int(input())
As = list(map(int, input().split()))
cnt = 0
mergeSort(As,0,n)
print(*As)
print(cnt) """
マージソート
分割統治法に基づく高速なアルゴリズム。
merge(A, left, mid, right)
  n1 = mid - left;
  n2 = right - mid;
  L[0...n1], R[0...n2] を生成
  for i = 0 to n1-1
    L[i] = A[left + i]
  for i = 0 to n2-1
    R[i] = A[mid + i]
  L[n1] = INFTY
  R[n2] = INFTY
  i = 0
  j = 0
  for k = left to right-1
    if L[i] <= R[j]
      A[k] = L[i]
      i = i + 1
    else 
      A[k] = R[j]
      j = j + 1

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 merge(A,left,mid,right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:left+n1] + [10**9+7]
    R = A[mid:mid+n2] + [10**9+7]
    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 = A[left:left+n1] + [10**9+7] L A[left:left+n1] + [10**9+7] A[left:left+n1] A left:left+n1 left left+n1 left n1 [10**9+7] 10**9+7 10**9 10 9 7 R = A[mid:mid+n2] + [10**9+7] R A[mid:mid+n2] + [10**9+7] A[mid:mid+n2] A mid:mid+n2 mid mid+n2 mid n2 [10**9+7] 10**9+7 10**9 10 9 7 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 n = int(input()) n int(input()) int input() input As = list(map(int, input().split())) As list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split cnt = 0 cnt 0 mergeSort(As,0,n) mergeSort As 0 n print(*As) print *As As print(cnt) print cnt def merge(A,left,mid,right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:left+n1] + [10**9+7]
    R = A[mid:mid+n2] + [10**9+7]
    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 = A[left:left+n1] + [10**9+7]
    R = A[mid:mid+n2] + [10**9+7]
    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 As = list(map(int, input().split())) list(map(int, input().split())) As 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
"""
マージソート
分割統治法に基づく高速なアルゴリズム。
merge(A, left, mid, right)
  n1 = mid - left;
  n2 = right - mid;
  L[0...n1], R[0...n2] を生成
  for i = 0 to n1-1
    L[i] = A[left + i]
  for i = 0 to n2-1
    R[i] = A[mid + i]
  L[n1] = INFTY
  R[n2] = INFTY
  i = 0
  j = 0
  for k = left to right-1
    if L[i] <= R[j]
      A[k] = L[i]
      i = i + 1
    else 
      A[k] = R[j]
      j = j + 1

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 merge(A,left,mid,right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:left+n1] + [10**9+7]
    R = A[mid:mid+n2] + [10**9+7]
    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)

n = int(input())
As = list(map(int, input().split()))
cnt = 0
mergeSort(As,0,n)
print(*As)
print(cnt)
