def merge(A, left, mid, right):
    global c
    L=A[left:mid]+[1e10]
    R=A[mid:right]+[1e10]
    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
        c+=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)
c=0
n=int(input())
A=list(map(int,input().split()))
mergeSort(A, 0, n)
print(*A)
print(c) def merge(A, left, mid, right):
    global c
    L=A[left:mid]+[1e10]
    R=A[mid:right]+[1e10]
    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
        c+=1 merge global c 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):
        if L[i] <= R[j]:
            A[k]=L[i]
            i+=1
        else:
            A[k]=R[j]
            j+=1
        c+=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 c+=1 c 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 c=0 c 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 mergeSort(A, 0, n) mergeSort A 0 n print(*A) print *A A print(c) print c 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 c=0 0 c A=list(map(int,input().split())) list(map(int,input().split())) A def merge(A, left, mid, right):
    global c
    L=A[left:mid]+[1e10]
    R=A[mid:right]+[1e10]
    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
        c+=1 def merge(A, left, mid, right):
    global c
    L=A[left:mid]+[1e10]
    R=A[mid:right]+[1e10]
    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
        c+=1 merge n=int(input()) int(input()) n
def merge(A, left, mid, right):
    global c
    L=A[left:mid]+[1e10]
    R=A[mid:right]+[1e10]
    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
        c+=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)
c=0
n=int(input())
A=list(map(int,input().split()))
mergeSort(A, 0, n)
print(*A)
print(c)
