n = int(input())
S = [*map(int, input().split())]

def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    
    L = list(range(n1+1))
    R = list(range(n2+1))
    
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
        
    L[n1] = 100000000000
    R[n2] = 100000000000
    
    i = 0
    j = 0
    
    for k in range(left, right):
        if L[i] < R[j]:
            A[k] = L[i]
            i = i + 1
            
        else:
            A[k] = R[j]
            j = j + 1
            
    return right - left
            
def mergeSort(A, left, right):
    count = 0
    if left+1 < right:
        mid = int((left + right) / 2)
        count += mergeSort(A, left, mid) + mergeSort(A, mid, right)
        count += merge(A, left, mid, right)

    return count

count = mergeSort(S, 0, n)
print(*S)
print(count) n = int(input()) n int(input()) int input() input S = [*map(int, input().split())] S [*map(int, input().split())] *map(int, input().split()) map(int, input().split()) map int input().split() ().split () input split def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    
    L = list(range(n1+1))
    R = list(range(n2+1))
    
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
        
    L[n1] = 100000000000
    R[n2] = 100000000000
    
    i = 0
    j = 0
    
    for k in range(left, right):
        if L[i] < R[j]:
            A[k] = L[i]
            i = i + 1
            
        else:
            A[k] = R[j]
            j = j + 1
            
    return right - left
             merge n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = list(range(n1+1)) L list(range(n1+1)) list range(n1+1) range n1+1 n1 1 R = list(range(n2+1)) R list(range(n2+1)) list range(n2+1) range 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] = 100000000000 L[n1] L n1 100000000000 R[n2] = 100000000000 R[n2] R n2 100000000000 i = 0 i 0 j = 0 j 0 for k in range(left, right):
        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 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 right - left right - left right left A A left left mid mid right right def mergeSort(A, left, right):
    count = 0
    if left+1 < right:
        mid = int((left + right) / 2)
        count += mergeSort(A, left, mid) + mergeSort(A, mid, right)
        count += merge(A, left, mid, right)

    return count mergeSort count = 0 count 0 if left+1 < right:
        mid = int((left + right) / 2)
        count += mergeSort(A, left, mid) + mergeSort(A, mid, right)
        count += 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 count += mergeSort(A, left, mid) + mergeSort(A, mid, right) count mergeSort(A, left, mid) + mergeSort(A, mid, right) mergeSort(A, left, mid) mergeSort A left mid mergeSort(A, mid, right) mergeSort A mid right count += merge(A, left, mid, right) count merge(A, left, mid, right) merge A left mid right return count count A A left left right right count = mergeSort(S, 0, n) count mergeSort(S, 0, n) mergeSort S 0 n print(*S) print *S S print(count) print count def mergeSort(A, left, right):
    count = 0
    if left+1 < right:
        mid = int((left + right) / 2)
        count += mergeSort(A, left, mid) + mergeSort(A, mid, right)
        count += merge(A, left, mid, right)

    return count def mergeSort(A, left, right):
    count = 0
    if left+1 < right:
        mid = int((left + right) / 2)
        count += mergeSort(A, left, mid) + mergeSort(A, mid, right)
        count += merge(A, left, mid, right)

    return count mergeSort S = [*map(int, input().split())] [*map(int, input().split())] S n = int(input()) int(input()) n count = mergeSort(S, 0, n) mergeSort(S, 0, n) count def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    
    L = list(range(n1+1))
    R = list(range(n2+1))
    
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
        
    L[n1] = 100000000000
    R[n2] = 100000000000
    
    i = 0
    j = 0
    
    for k in range(left, right):
        if L[i] < R[j]:
            A[k] = L[i]
            i = i + 1
            
        else:
            A[k] = R[j]
            j = j + 1
            
    return right - left
             def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    
    L = list(range(n1+1))
    R = list(range(n2+1))
    
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
        
    L[n1] = 100000000000
    R[n2] = 100000000000
    
    i = 0
    j = 0
    
    for k in range(left, right):
        if L[i] < R[j]:
            A[k] = L[i]
            i = i + 1
            
        else:
            A[k] = R[j]
            j = j + 1
            
    return right - left
             merge
n = int(input())
S = [*map(int, input().split())]

def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    
    L = list(range(n1+1))
    R = list(range(n2+1))
    
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
        
    L[n1] = 100000000000
    R[n2] = 100000000000
    
    i = 0
    j = 0
    
    for k in range(left, right):
        if L[i] < R[j]:
            A[k] = L[i]
            i = i + 1
            
        else:
            A[k] = R[j]
            j = j + 1
            
    return right - left
            
def mergeSort(A, left, right):
    count = 0
    if left+1 < right:
        mid = int((left + right) / 2)
        count += mergeSort(A, left, mid) + mergeSort(A, mid, right)
        count += merge(A, left, mid, right)

    return count

count = mergeSort(S, 0, n)
print(*S)
print(count)
