def merge(cnt, A, left, mid, right):
    L = A[left:mid] + [1e+99]
    R = A[mid:right] + [1e+99]
    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
    cnt.append(right - left)

            
def mergeSort(cnt, A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        mergeSort(cnt, A, left, mid)
        mergeSort(cnt, A, mid, right)
        merge(cnt, A, left, mid, right)
        
        
import sys
def input():
    return sys.stdin.readline()[:-1]
    
n = int(input())
S = list(map(int, input().split()))

from collections import deque
cnt = deque()
mergeSort(cnt,S,0,n)

print(*S)
print(sum(cnt))
 def merge(cnt, A, left, mid, right):
    L = A[left:mid] + [1e+99]
    R = A[mid:right] + [1e+99]
    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
    cnt.append(right - left)

             merge L = A[left:mid] + [1e+99] L A[left:mid] + [1e+99] A[left:mid] A left:mid left mid [1e+99] 1e+99 R = A[mid:right] + [1e+99] R A[mid:right] + [1e+99] A[mid:right] A mid:right mid right [1e+99] 1e+99 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 cnt.append(right - left) cnt.append cnt append right - left right left cnt cnt A A left left mid mid right right def mergeSort(cnt, A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        mergeSort(cnt, A, left, mid)
        mergeSort(cnt, A, mid, right)
        merge(cnt, A, left, mid, right)
        
         mergeSort if left+1 < right:
        mid = (left + right) // 2
        mergeSort(cnt, A, left, mid)
        mergeSort(cnt, A, mid, right)
        merge(cnt, 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(cnt, A, left, mid) mergeSort cnt A left mid mergeSort(cnt, A, mid, right) mergeSort cnt A mid right merge(cnt, A, left, mid, right) merge cnt A left mid right cnt cnt A A left left right right import sys sys def input():
    return sys.stdin.readline()[:-1]
     input return sys.stdin.readline()[:-1] sys.stdin.readline()[:-1] sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline :-1 -1 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 from collections import deque cnt = deque() cnt deque() deque mergeSort(cnt,S,0,n) mergeSort cnt S 0 n print(*S) print *S S print(sum(cnt)) print sum(cnt) sum cnt S = list(map(int, input().split())) list(map(int, input().split())) S cnt = deque() deque() cnt n = int(input()) int(input()) n def input():
    return sys.stdin.readline()[:-1]
     def input():
    return sys.stdin.readline()[:-1]
     input def merge(cnt, A, left, mid, right):
    L = A[left:mid] + [1e+99]
    R = A[mid:right] + [1e+99]
    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
    cnt.append(right - left)

             def merge(cnt, A, left, mid, right):
    L = A[left:mid] + [1e+99]
    R = A[mid:right] + [1e+99]
    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
    cnt.append(right - left)

             merge def mergeSort(cnt, A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        mergeSort(cnt, A, left, mid)
        mergeSort(cnt, A, mid, right)
        merge(cnt, A, left, mid, right)
        
         def mergeSort(cnt, A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        mergeSort(cnt, A, left, mid)
        mergeSort(cnt, A, mid, right)
        merge(cnt, A, left, mid, right)
        
         mergeSort
def merge(cnt, A, left, mid, right):
    L = A[left:mid] + [1e+99]
    R = A[mid:right] + [1e+99]
    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
    cnt.append(right - left)

            
def mergeSort(cnt, A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        mergeSort(cnt, A, left, mid)
        mergeSort(cnt, A, mid, right)
        merge(cnt, A, left, mid, right)
        
        
import sys
def input():
    return sys.stdin.readline()[:-1]
    
n = int(input())
S = list(map(int, input().split()))

from collections import deque
cnt = deque()
mergeSort(cnt,S,0,n)

print(*S)
print(sum(cnt))

