def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    INF = 1000000001

    L = A[left:left + n1] + [INF]
    R = A[mid:mid + n2] + [INF]

    i = 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
    return right - left
            
def mergeSort(A, left, right):
    cnt = 0
    if left+1 < right:
        mid = (left + right) // 2
        cnt += mergeSort(A, left, mid)
        cnt += mergeSort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt

n = int(input())
A = list(map(int, input().split()))
left = 0
right = n
cnt = mergeSort(A, left, right)
print(' '.join(map(str, A)))
print(cnt) def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    INF = 1000000001

    L = A[left:left + n1] + [INF]
    R = A[mid:mid + n2] + [INF]

    i = 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
    return right - left
             merge n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid INF = 1000000001 INF 1000000001 L = A[left:left + n1] + [INF] L A[left:left + n1] + [INF] A[left:left + n1] A left:left + n1 left left + n1 left n1 [INF] INF R = A[mid:mid + n2] + [INF] R A[mid:mid + n2] + [INF] A[mid:mid + n2] A mid:mid + n2 mid mid + n2 mid n2 [INF] INF i = 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):
    cnt = 0
    if left+1 < right:
        mid = (left + right) // 2
        cnt += mergeSort(A, left, mid)
        cnt += mergeSort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt mergeSort cnt = 0 cnt 0 if left+1 < right:
        mid = (left + right) // 2
        cnt += mergeSort(A, left, mid)
        cnt += mergeSort(A, mid, right)
        cnt += 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 cnt += mergeSort(A, left, mid) cnt mergeSort(A, left, mid) mergeSort A left mid cnt += mergeSort(A, mid, right) cnt mergeSort(A, mid, right) mergeSort A mid right cnt += merge(A, left, mid, right) cnt merge(A, left, mid, right) merge A left mid right return cnt cnt A A left left right right 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 left = 0 left 0 right = n right n cnt = mergeSort(A, left, right) cnt mergeSort(A, left, right) mergeSort A left right print(' '.join(map(str, A))) print ' '.join(map(str, A)) ' '.join ' ' join map(str, A) map str A print(cnt) print cnt def mergeSort(A, left, right):
    cnt = 0
    if left+1 < right:
        mid = (left + right) // 2
        cnt += mergeSort(A, left, mid)
        cnt += mergeSort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt def mergeSort(A, left, right):
    cnt = 0
    if left+1 < right:
        mid = (left + right) // 2
        cnt += mergeSort(A, left, mid)
        cnt += mergeSort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt mergeSort n = int(input()) int(input()) n right = n n right def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    INF = 1000000001

    L = A[left:left + n1] + [INF]
    R = A[mid:mid + n2] + [INF]

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

    L = A[left:left + n1] + [INF]
    R = A[mid:mid + n2] + [INF]

    i = 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
    return right - left
             merge cnt = mergeSort(A, left, right) mergeSort(A, left, right) cnt left = 0 0 left A = list(map(int, input().split())) list(map(int, input().split())) A
def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    INF = 1000000001

    L = A[left:left + n1] + [INF]
    R = A[mid:mid + n2] + [INF]

    i = 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
    return right - left
            
def mergeSort(A, left, right):
    cnt = 0
    if left+1 < right:
        mid = (left + right) // 2
        cnt += mergeSort(A, left, mid)
        cnt += mergeSort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt

n = int(input())
A = list(map(int, input().split()))
left = 0
right = n
cnt = mergeSort(A, left, right)
print(' '.join(map(str, A)))
print(cnt)
