import sys
from sys import stdin
input = stdin.readline

cnt = 0
INF = 10000000000

def merge(A, left, mid,  right):
  global cnt
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  i = 0
  j = 0
  for k  in range(left , right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i = i + 1
      cnt += 1
    else:
      A[k] = R[j]
      j = j + 1
      cnt += 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())
A =[int(x) for x in input().split()]
mergeSort(A, 0, n)

print(*A)
print(cnt) import sys sys from sys import stdin input = stdin.readline input stdin.readline stdin readline cnt = 0 cnt 0 INF = 10000000000 INF 10000000000 def merge(A, left, mid,  right):
  global cnt
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  i = 0
  j = 0
  for k  in range(left , right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i = i + 1
      cnt += 1
    else:
      A[k] = R[j]
      j = j + 1
      cnt += 1 merge global cnt 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 for k  in range(left , right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i = i + 1
      cnt += 1
    else:
      A[k] = R[j]
      j = j + 1
      cnt += 1 k range(left , right) range left right if L[i] <= R[j]:
      A[k] = L[i]
      i = i + 1
      cnt += 1
    else:
      A[k] = R[j]
      j = j + 1
      cnt += 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 = i + 1 i i + 1 i 1 cnt += 1 cnt 1 A[k] = R[j] A[k] A k R[j] R j j = j + 1 j j + 1 j 1 cnt += 1 cnt 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 int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x A =[int(x) for x in input().split()] A [int(x) for x in input().split()] mergeSort(A, 0, n) mergeSort A 0 n print(*A) print *A A print(cnt) print cnt A =[int(x) for x in input().split()] [int(x) for x in input().split()] A 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 def merge(A, left, mid,  right):
  global cnt
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  i = 0
  j = 0
  for k  in range(left , right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i = i + 1
      cnt += 1
    else:
      A[k] = R[j]
      j = j + 1
      cnt += 1 def merge(A, left, mid,  right):
  global cnt
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  i = 0
  j = 0
  for k  in range(left , right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i = i + 1
      cnt += 1
    else:
      A[k] = R[j]
      j = j + 1
      cnt += 1 merge cnt = 0 0 cnt INF = 10000000000 10000000000 INF input = stdin.readline stdin.readline input
import sys
from sys import stdin
input = stdin.readline

cnt = 0
INF = 10000000000

def merge(A, left, mid,  right):
  global cnt
  L = A[left:mid] + [INF]
  R = A[mid:right] + [INF]
  i = 0
  j = 0
  for k  in range(left , right):
    if L[i] <= R[j]:
      A[k] = L[i]
      i = i + 1
      cnt += 1
    else:
      A[k] = R[j]
      j = j + 1
      cnt += 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())
A =[int(x) for x in input().split()]
mergeSort(A, 0, n)

print(*A)
print(cnt)
