#ALDS1_5_B
sum = 0

def merge(A, left, mid, right):
    global sum
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
#     L = A[left:mid]
    R = [0] * (n2+1)
#     R = A[mid:right]
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 10**9
#     L.append(10**9)
    R[n2] = 10**9
#     R.append(10**9)
    i = 0
    j = 0
    for k in range(left, right):
        sum += 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)
        
n = int(input())
S = list(map(int, input().split()))

mergeSort(S, 0, len(S))
print(*S)
print(sum) sum = 0 sum 0 def merge(A, left, mid, right):
    global sum
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
#     L = A[left:mid]
    R = [0] * (n2+1)
#     R = A[mid:right]
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 10**9
#     L.append(10**9)
    R[n2] = 10**9
#     R.append(10**9)
    i = 0
    j = 0
    for k in range(left, right):
        sum += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
             merge global sum n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = [0] * (n1+1) L [0] * (n1+1) [0] 0 n1+1 n1 1 R = [0] * (n2+1) R [0] * (n2+1) [0] 0 n2+1 n2 1 for i in range(n1):
        L[i] = A[left + i]
     i range(n1) range n1 L[i] = A[left + i] L[i] L i A[left + i] A left + i left i for i in range(n2):
        R[i] = A[mid + i]
     i range(n2) range n2 R[i] = A[mid + i] R[i] R i A[mid + i] A mid + i mid i L[n1] = 10**9 L[n1] L n1 10**9 10 9 R[n2] = 10**9 R[n2] R n2 10**9 10 9 i = 0 i 0 j = 0 j 0 for k in range(left, right):
        sum += 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 sum += 1 sum 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 n = int(input()) n int(input()) int input() input S = list(map(int, input().split())) S list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split mergeSort(S, 0, len(S)) mergeSort S 0 len(S) len S print(*S) print *S S print(sum) print sum 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 sum = 0 0 sum def merge(A, left, mid, right):
    global sum
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
#     L = A[left:mid]
    R = [0] * (n2+1)
#     R = A[mid:right]
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 10**9
#     L.append(10**9)
    R[n2] = 10**9
#     R.append(10**9)
    i = 0
    j = 0
    for k in range(left, right):
        sum += 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 sum
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
#     L = A[left:mid]
    R = [0] * (n2+1)
#     R = A[mid:right]
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 10**9
#     L.append(10**9)
    R[n2] = 10**9
#     R.append(10**9)
    i = 0
    j = 0
    for k in range(left, right):
        sum += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1
             merge n = int(input()) int(input()) n S = list(map(int, input().split())) list(map(int, input().split())) S
#ALDS1_5_B
sum = 0

def merge(A, left, mid, right):
    global sum
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
#     L = A[left:mid]
    R = [0] * (n2+1)
#     R = A[mid:right]
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 10**9
#     L.append(10**9)
    R[n2] = 10**9
#     R.append(10**9)
    i = 0
    j = 0
    for k in range(left, right):
        sum += 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)
        
n = int(input())
S = list(map(int, input().split()))

mergeSort(S, 0, len(S))
print(*S)
print(sum)
