INFTY = 10 ** 9
count = 0

def merge(A, left, mid, right):
    global count

    n1 = mid - left
    n2 = right - mid

    L = A[left:mid] + [INFTY]
    R = A[mid:right] + [INFTY]

    i = 0
    j = 0
    for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
        
        count += 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())
S = list(map(int, input().split()))

mergeSort(S, 0, len(S))
print(*S)
print(count) INFTY = 10 ** 9 INFTY 10 ** 9 10 9 count = 0 count 0 def merge(A, left, mid, right):
    global count

    n1 = mid - left
    n2 = right - mid

    L = A[left:mid] + [INFTY]
    R = A[mid:right] + [INFTY]

    i = 0
    j = 0
    for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
        
        count += 1 merge global count n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = A[left:mid] + [INFTY] L A[left:mid] + [INFTY] A[left:mid] A left:mid left mid [INFTY] INFTY R = A[mid:right] + [INFTY] R A[mid:right] + [INFTY] A[mid:right] A mid:right mid right [INFTY] INFTY i = 0 i 0 j = 0 j 0 for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
        
        count += 1 k range(left, right) range left right 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 count += 1 count 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 S = list(map(int, input().split())) S list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split mergeSort(S, 0, len(S)) mergeSort S 0 len(S) len S print(*S) print *S S print(count) print count INFTY = 10 ** 9 10 ** 9 INFTY def merge(A, left, mid, right):
    global count

    n1 = mid - left
    n2 = right - mid

    L = A[left:mid] + [INFTY]
    R = A[mid:right] + [INFTY]

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

    n1 = mid - left
    n2 = right - mid

    L = A[left:mid] + [INFTY]
    R = A[mid:right] + [INFTY]

    i = 0
    j = 0
    for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
        
        count += 1 merge S = list(map(int, input().split())) list(map(int, input().split())) S n = int(input()) int(input()) n count = 0 0 count 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
INFTY = 10 ** 9
count = 0

def merge(A, left, mid, right):
    global count

    n1 = mid - left
    n2 = right - mid

    L = A[left:mid] + [INFTY]
    R = A[mid:right] + [INFTY]

    i = 0
    j = 0
    for k in range(left, right):
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
        
        count += 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())
S = list(map(int, input().split()))

mergeSort(S, 0, len(S))
print(*S)
print(count)
