def merge(A, left, mid, right):
    inf = float("inf")
    L, R = A[left:mid]+[inf], A[mid:right]+[inf]

    i = 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

    return right - left


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

    return count


if __name__ == "__main__":
    n = int(input())
    A = list(map(int, input().split()))
    count = merge_sort(A, 0, n)
    print(*A)
    print(count) def merge(A, left, mid, right):
    inf = float("inf")
    L, R = A[left:mid]+[inf], A[mid:right]+[inf]

    i = 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

    return right - left merge inf = float("inf") inf float("inf") float "inf" L, R = A[left:mid]+[inf], A[mid:right]+[inf] L A[left:mid]+[inf] A[left:mid] A left:mid left mid [inf] inf R A[mid:right]+[inf] A[mid:right] A mid:right mid right [inf] inf i = j = 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 return right - left right - left right left A A left left mid mid right right def merge_sort(A, left, right, count=0):
    if left+1 < right:
        mid = (left + right) // 2
        count = merge_sort(A, left, mid, count)
        count = merge_sort(A, mid, right, count)
        count += merge(A, left, mid, right)

    return count merge_sort if left+1 < right:
        mid = (left + right) // 2
        count = merge_sort(A, left, mid, count)
        count = merge_sort(A, mid, right, count)
        count += 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 count = merge_sort(A, left, mid, count) count merge_sort(A, left, mid, count) merge_sort A left mid count count = merge_sort(A, mid, right, count) count merge_sort(A, mid, right, count) merge_sort A mid right count 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=0 count 0 if __name__ == "__main__":
    n = int(input())
    A = list(map(int, input().split()))
    count = merge_sort(A, 0, n)
    print(*A)
    print(count) __name__ == "__main__" __name__ "__main__" 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 count = merge_sort(A, 0, n) count merge_sort(A, 0, n) merge_sort A 0 n print(*A) print *A A print(count) print count def merge(A, left, mid, right):
    inf = float("inf")
    L, R = A[left:mid]+[inf], A[mid:right]+[inf]

    i = 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

    return right - left def merge(A, left, mid, right):
    inf = float("inf")
    L, R = A[left:mid]+[inf], A[mid:right]+[inf]

    i = 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

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

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

    return count merge_sort count = merge_sort(A, 0, n) merge_sort(A, 0, n) count A = list(map(int, input().split())) list(map(int, input().split())) A
def merge(A, left, mid, right):
    inf = float("inf")
    L, R = A[left:mid]+[inf], A[mid:right]+[inf]

    i = 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

    return right - left


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

    return count


if __name__ == "__main__":
    n = int(input())
    A = list(map(int, input().split()))
    count = merge_sort(A, 0, n)
    print(*A)
    print(count)
