"""Merge Sort."""

def merge(A, left, mid, right):
    """Merge the two sorted partial sequences A[left:mid] and A[mid:right].

    To count the number of comparisons,
    make a global declaration for the variable cnt.
    """
    L = A[left:mid]
    L.append(10**9 + 1)
    R = A[mid:right]
    R.append(10**9 + 1)
    i = 0
    j = 0
    global cnt
    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

def mergeSort(A, left, right):
    """Sort elements in list A using Merge Sort algorithm.

    left is the starting index, initially 0.
    right is the value added 1 to the last index, initially the length of A.
    """
    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()))

cnt = 0

mergeSort(S, 0, n)

print(*S)
print(cnt) """Merge Sort.""" def merge(A, left, mid, right):
    """Merge the two sorted partial sequences A[left:mid] and A[mid:right].

    To count the number of comparisons,
    make a global declaration for the variable cnt.
    """
    L = A[left:mid]
    L.append(10**9 + 1)
    R = A[mid:right]
    R.append(10**9 + 1)
    i = 0
    j = 0
    global cnt
    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 merge """Merge the two sorted partial sequences A[left:mid] and A[mid:right].

    To count the number of comparisons,
    make a global declaration for the variable cnt.
    """ L = A[left:mid] L A[left:mid] A left:mid left mid L.append(10**9 + 1) L.append L append 10**9 + 1 10**9 10 9 1 R = A[mid:right] R A[mid:right] A mid:right mid right R.append(10**9 + 1) R.append R append 10**9 + 1 10**9 10 9 1 i = 0 i 0 j = 0 j 0 global cnt 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 A A left left mid mid right right def mergeSort(A, left, right):
    """Sort elements in list A using Merge Sort algorithm.

    left is the starting index, initially 0.
    right is the value added 1 to the last index, initially the length of A.
    """
    if left + 1 < right:
        mid = (left + right) // 2
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right) mergeSort """Sort elements in list A using Merge Sort algorithm.

    left is the starting index, initially 0.
    right is the value added 1 to the last index, initially the length of A.
    """ 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 cnt = 0 cnt 0 mergeSort(S, 0, n) mergeSort S 0 n print(*S) print *S S print(cnt) print cnt def mergeSort(A, left, right):
    """Sort elements in list A using Merge Sort algorithm.

    left is the starting index, initially 0.
    right is the value added 1 to the last index, initially the length of A.
    """
    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):
    """Sort elements in list A using Merge Sort algorithm.

    left is the starting index, initially 0.
    right is the value added 1 to the last index, initially the length of A.
    """
    if left + 1 < right:
        mid = (left + right) // 2
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right) mergeSort S = list(map(int, input().split())) list(map(int, input().split())) S n = int(input()) int(input()) n def merge(A, left, mid, right):
    """Merge the two sorted partial sequences A[left:mid] and A[mid:right].

    To count the number of comparisons,
    make a global declaration for the variable cnt.
    """
    L = A[left:mid]
    L.append(10**9 + 1)
    R = A[mid:right]
    R.append(10**9 + 1)
    i = 0
    j = 0
    global cnt
    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 def merge(A, left, mid, right):
    """Merge the two sorted partial sequences A[left:mid] and A[mid:right].

    To count the number of comparisons,
    make a global declaration for the variable cnt.
    """
    L = A[left:mid]
    L.append(10**9 + 1)
    R = A[mid:right]
    R.append(10**9 + 1)
    i = 0
    j = 0
    global cnt
    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 merge cnt = 0 0 cnt
"""Merge Sort."""

def merge(A, left, mid, right):
    """Merge the two sorted partial sequences A[left:mid] and A[mid:right].

    To count the number of comparisons,
    make a global declaration for the variable cnt.
    """
    L = A[left:mid]
    L.append(10**9 + 1)
    R = A[mid:right]
    R.append(10**9 + 1)
    i = 0
    j = 0
    global cnt
    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

def mergeSort(A, left, right):
    """Sort elements in list A using Merge Sort algorithm.

    left is the starting index, initially 0.
    right is the value added 1 to the last index, initially the length of A.
    """
    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()))

cnt = 0

mergeSort(S, 0, n)

print(*S)
print(cnt)