import sys
sys.setrecursionlimit(10000)
num = int(input())
cnt = 0
def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid]  + [ 1e10 ]
    R = A[mid:right] + [ 1e10 ]
    i = 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)

L = [int(x) for x in input().split()]
c = mergeSort(L, 0, len(L))
print(" ".join(map(str,L)))
print(cnt)
 import sys sys sys.setrecursionlimit(10000) sys.setrecursionlimit sys setrecursionlimit 10000 num = int(input()) num int(input()) int input() input cnt = 0 cnt 0 def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid]  + [ 1e10 ]
    R = A[mid:right] + [ 1e10 ]
    i = 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:mid]  + [ 1e10 ] L A[left:mid]  + [ 1e10 ] A[left:mid] A left:mid left mid [ 1e10 ] 1e10 R = A[mid:right] + [ 1e10 ] R A[mid:right] + [ 1e10 ] A[mid:right] A mid:right mid right [ 1e10 ] 1e10 i = j = 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 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 L = [int(x) for x in input().split()] L [int(x) for x in input().split()] c = mergeSort(L, 0, len(L)) c mergeSort(L, 0, len(L)) mergeSort L 0 len(L) len L print(" ".join(map(str,L))) print " ".join(map(str,L)) " ".join " " join map(str,L) map str L print(cnt) print cnt 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 num = int(input()) int(input()) num cnt = 0 0 cnt def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid]  + [ 1e10 ]
    R = A[mid:right] + [ 1e10 ]
    i = 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:mid]  + [ 1e10 ]
    R = A[mid:right] + [ 1e10 ]
    i = 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 c = mergeSort(L, 0, len(L)) mergeSort(L, 0, len(L)) c L = [int(x) for x in input().split()] [int(x) for x in input().split()] L
import sys
sys.setrecursionlimit(10000)
num = int(input())
cnt = 0
def merge(A, left, mid, right):
    global cnt
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid]  + [ 1e10 ]
    R = A[mid:right] + [ 1e10 ]
    i = 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)

L = [int(x) for x in input().split()]
c = mergeSort(L, 0, len(L))
print(" ".join(map(str,L)))
print(cnt)

