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

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

n = int(input())

A = list(map(int, input().split()))

cnt = mergeSort(A, n, 0, n)

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

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

n = int(input())

A = list(map(int, input().split()))

cnt = mergeSort(A, n, 0, n)

print(*A)
print(cnt)
