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

    inf = float('inf')
    L = A[left:mid]+[inf]
    R = A[mid:right] + [inf]

    i = 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
    return right - left


def mergeSort(A, left, right, count = 0):
    if left+1 < right:
        mid = (left + right)//2
        count = mergeSort(A, left, mid, count)
        count = mergeSort(A, mid, right, count)
        count += merge(A, left, mid, right)
    return count

n  = int(input())
A = list(map(int, input().split()))
ans = mergeSort(A, 0, n)
s = list(map(str, A))
print(' '.join(s))
print(ans)

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

    inf = float('inf')
    L = A[left:mid]+[inf]
    R = A[mid:right] + [inf]

    i = 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
    return right - left merge inf = float('inf') inf float('inf') float 'inf' 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 = j = 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
     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 return right - left right - left right left A A left left mid mid right right def mergeSort(A, left, right, count = 0):
    if left+1 < right:
        mid = (left + right)//2
        count = mergeSort(A, left, mid, count)
        count = mergeSort(A, mid, right, count)
        count += merge(A, left, mid, right)
    return count mergeSort if left+1 < right:
        mid = (left + right)//2
        count = mergeSort(A, left, mid, count)
        count = mergeSort(A, mid, right, count)
        count += 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 count = mergeSort(A, left, mid, count) count mergeSort(A, left, mid, count) mergeSort A left mid count count = mergeSort(A, mid, right, count) count mergeSort(A, mid, right, count) mergeSort A mid right count count += merge(A, left, mid, right) count merge(A, left, mid, right) merge A left mid right return count count A A left left right right count = 0 count 0 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 ans = mergeSort(A, 0, n) ans mergeSort(A, 0, n) mergeSort A 0 n s = list(map(str, A)) s list(map(str, A)) list map(str, A) map str A print(' '.join(s)) print ' '.join(s) ' '.join ' ' join s print(ans) print ans ans = mergeSort(A, 0, n) mergeSort(A, 0, n) ans n  = int(input()) int(input()) n def merge(A, left, mid, right):

    inf = float('inf')
    L = A[left:mid]+[inf]
    R = A[mid:right] + [inf]

    i = 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
    return right - left def merge(A, left, mid, right):

    inf = float('inf')
    L = A[left:mid]+[inf]
    R = A[mid:right] + [inf]

    i = 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
    return right - left merge A = list(map(int, input().split())) list(map(int, input().split())) A def mergeSort(A, left, right, count = 0):
    if left+1 < right:
        mid = (left + right)//2
        count = mergeSort(A, left, mid, count)
        count = mergeSort(A, mid, right, count)
        count += merge(A, left, mid, right)
    return count def mergeSort(A, left, right, count = 0):
    if left+1 < right:
        mid = (left + right)//2
        count = mergeSort(A, left, mid, count)
        count = mergeSort(A, mid, right, count)
        count += merge(A, left, mid, right)
    return count mergeSort s = list(map(str, A)) list(map(str, A)) s
def merge(A, left, mid, right):

    inf = float('inf')
    L = A[left:mid]+[inf]
    R = A[mid:right] + [inf]

    i = 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
    return right - left


def mergeSort(A, left, right, count = 0):
    if left+1 < right:
        mid = (left + right)//2
        count = mergeSort(A, left, mid, count)
        count = mergeSort(A, mid, right, count)
        count += merge(A, left, mid, right)
    return count

n  = int(input())
A = list(map(int, input().split()))
ans = mergeSort(A, 0, n)
s = list(map(str, A))
print(' '.join(s))
print(ans)


