#INF = 10**9 + 1
def merge(A, left, mid, right):
    global count
    L = [A[i] for i in range(left, mid)] + [10**9 + 1]
    R = [A[i] for i in range(mid, right)] + [10**9 + 1]
    i,j = 0,0
    for k in range(left, right):
        count += 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 = int((left + right) / 2)
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right)

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

count = 0
n = int(input())
S = list(map(int,input().split()))
mergeSort(S, 0, n)
print(*S)
print(count)
