n = int(input())
A = list(map(int, input().split()))
count = 0
def Merge(A, left, mid, right):
    global count
    L = A[left:mid]+[10**9]
    R = A[mid:right]+[10**9]

    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

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(A, 0, n)
print(' '.join([str(_) for _ in A]))
print(count)

 n = int(input()) n int(input()) int input() input A = list(map(int, input().split())) A list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split count = 0 count 0 def Merge(A, left, mid, right):
    global count
    L = A[left:mid]+[10**9]
    R = A[mid:right]+[10**9]

    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 Merge global count L = A[left:mid]+[10**9] L A[left:mid]+[10**9] A[left:mid] A left:mid left mid [10**9] 10**9 10 9 R = A[mid:right]+[10**9] R A[mid:right]+[10**9] A[mid:right] A mid:right mid right [10**9] 10**9 10 9 i = 0 i 0 j = 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 = (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 MergeSort(A, 0, n) MergeSort A 0 n str(_) for _ in A for _ in A _ A for _ in A str(_) str _ print(' '.join([str(_) for _ in A])) print ' '.join([str(_) for _ in A]) ' '.join ' ' join [str(_) for _ in A] print(count) print 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 def Merge(A, left, mid, right):
    global count
    L = A[left:mid]+[10**9]
    R = A[mid:right]+[10**9]

    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 def Merge(A, left, mid, right):
    global count
    L = A[left:mid]+[10**9]
    R = A[mid:right]+[10**9]

    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 Merge count = 0 0 count n = int(input()) int(input()) n A = list(map(int, input().split())) list(map(int, input().split())) A
n = int(input())
A = list(map(int, input().split()))
count = 0
def Merge(A, left, mid, right):
    global count
    L = A[left:mid]+[10**9]
    R = A[mid:right]+[10**9]

    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

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(A, 0, n)
print(' '.join([str(_) for _ in A]))
print(count)


