"""
マージソートを実装する
"""
count = 0

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

    n1 = mid-left
    n2 = right-mid

    L = [0]*(n1+1)
    for i in range(n1):
        L[i] = A[left+i]
    
    R = [0]*(n2+1)
    for i in range(n2):
        R[i] = A[mid+i]
    
    L[n1] = 10000000000
    R[n2] = 10000000000

    i, j = 0, 0 
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i+1
        else:
            A[k] = R[j]
            j = j+1
    return count
    
def mergeSort(A, left, right):
    if left+1 < right:
        mid = (left+right)//2
        #sortする
        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, n)
s = map(str, s)
print(' '.join(s))
print(count)
     """
マージソートを実装する
""" count = 0 count 0 def merge(A, left, mid, right):
    global count

    n1 = mid-left
    n2 = right-mid

    L = [0]*(n1+1)
    for i in range(n1):
        L[i] = A[left+i]
    
    R = [0]*(n2+1)
    for i in range(n2):
        R[i] = A[mid+i]
    
    L[n1] = 10000000000
    R[n2] = 10000000000

    i, j = 0, 0 
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i+1
        else:
            A[k] = R[j]
            j = j+1
    return count
     merge global count 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 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 R = [0]*(n2+1) R [0]*(n2+1) [0] 0 n2+1 n2 1 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] = 10000000000 L[n1] L n1 10000000000 R[n2] = 10000000000 R[n2] R n2 10000000000 i, j = 0, 0 i 0 j 0 for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i+1
        else:
            A[k] = R[j]
            j = j+1
     k range(left, right) range left right count += 1 count 1 if L[i] <= R[j]:
            A[k] = L[i]
            i = i+1
        else:
            A[k] = R[j]
            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 = i+1 i i+1 i 1 A[k] = R[j] A[k] A k R[j] R j j = j+1 j j+1 j 1 return count count A A left left mid mid right right def mergeSort(A, left, right):
    if left+1 < right:
        mid = (left+right)//2
        #sortする
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        #統合する
        merge(A, left, mid ,right) mergeSort if left+1 < right:
        mid = (left+right)//2
        #sortする
        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, n) mergeSort s 0 n s = map(str, s) s map(str, s) map str s print(' '.join(s)) print ' '.join(s) ' '.join ' ' join s print(count) print count def mergeSort(A, left, right):
    if left+1 < right:
        mid = (left+right)//2
        #sortする
        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
        #sortする
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        #統合する
        merge(A, left, mid ,right) mergeSort count = 0 0 count n = int(input()) int(input()) n s = list(map(int, input().split())) list(map(int, input().split())) s def merge(A, left, mid, right):
    global count

    n1 = mid-left
    n2 = right-mid

    L = [0]*(n1+1)
    for i in range(n1):
        L[i] = A[left+i]
    
    R = [0]*(n2+1)
    for i in range(n2):
        R[i] = A[mid+i]
    
    L[n1] = 10000000000
    R[n2] = 10000000000

    i, j = 0, 0 
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i+1
        else:
            A[k] = R[j]
            j = j+1
    return count
     def merge(A, left, mid, right):
    global count

    n1 = mid-left
    n2 = right-mid

    L = [0]*(n1+1)
    for i in range(n1):
        L[i] = A[left+i]
    
    R = [0]*(n2+1)
    for i in range(n2):
        R[i] = A[mid+i]
    
    L[n1] = 10000000000
    R[n2] = 10000000000

    i, j = 0, 0 
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i+1
        else:
            A[k] = R[j]
            j = j+1
    return count
     merge s = map(str, s) map(str, s) s
"""
マージソートを実装する
"""
count = 0

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

    n1 = mid-left
    n2 = right-mid

    L = [0]*(n1+1)
    for i in range(n1):
        L[i] = A[left+i]
    
    R = [0]*(n2+1)
    for i in range(n2):
        R[i] = A[mid+i]
    
    L[n1] = 10000000000
    R[n2] = 10000000000

    i, j = 0, 0 
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i+1
        else:
            A[k] = R[j]
            j = j+1
    return count
    
def mergeSort(A, left, right):
    if left+1 < right:
        mid = (left+right)//2
        #sortする
        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, n)
s = map(str, s)
print(' '.join(s))
print(count)
    
