INF = 10000000000

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

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

    i, j= 0, 0

    for k in range(left, right):
        anw += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1

def mergeSort(A, left, right):
    global anw
    if left + 1 < right:
        mid = int(( left + right ) / 2)
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right)

if __name__ == '__main__':
    n = int(input())
    S = [int(x) for x in input().split()]
    anw = 0
    mergeSort(S, 0, n)
    print(*S)
    print(anw) INF = 10000000000 INF 10000000000 def merge(A, left, mid, right):
    global anw

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

    i, j= 0, 0

    for k in range(left, right):
        anw += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 merge global anw 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, 0 i 0 j 0 for k in range(left, right):
        anw += 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 anw += 1 anw 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):
    global anw
    if left + 1 < right:
        mid = int(( left + right ) / 2)
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right) mergeSort global anw 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 if __name__ == '__main__':
    n = int(input())
    S = [int(x) for x in input().split()]
    anw = 0
    mergeSort(S, 0, n)
    print(*S)
    print(anw) __name__ == '__main__' __name__ '__main__' n = int(input()) n int(input()) int input() input int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x S = [int(x) for x in input().split()] S [int(x) for x in input().split()] anw = 0 anw 0 mergeSort(S, 0, n) mergeSort S 0 n print(*S) print *S S print(anw) print anw def merge(A, left, mid, right):
    global anw

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

    i, j= 0, 0

    for k in range(left, right):
        anw += 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 anw

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

    i, j= 0, 0

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

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

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

    i, j= 0, 0

    for k in range(left, right):
        anw += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1

def mergeSort(A, left, right):
    global anw
    if left + 1 < right:
        mid = int(( left + right ) / 2)
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right)

if __name__ == '__main__':
    n = int(input())
    S = [int(x) for x in input().split()]
    anw = 0
    mergeSort(S, 0, n)
    print(*S)
    print(anw)
