count = 0


def main():
    input()
    A = [int(x) for x in list(input().split())]
    merge_sort(A, 0, len(A))
    print(*A)
    print(count)


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


def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid

    # リストの左側を作成
    L = A[left:mid]

    # リストの右側を作成
    R = A[mid:right]

    # 終端追加
    L.append(float("inf"))
    R.append(float("inf"))

    i = 0
    j = 0
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1


if __name__ == '__main__':
    main()
 count = 0 count 0 def main():
    input()
    A = [int(x) for x in list(input().split())]
    merge_sort(A, 0, len(A))
    print(*A)
    print(count) main input() input int(x) for x in list(input().split()) for x in list(input().split()) x list(input().split()) list input().split() ().split () input split for x in list(input().split()) int(x) int x A = [int(x) for x in list(input().split())] A [int(x) for x in list(input().split())] merge_sort(A, 0, len(A)) merge_sort A 0 len(A) len A print(*A) print *A A print(count) print count def merge_sort(A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        merge_sort(A, left, mid)
        merge_sort(A, mid, right)
        merge(A, left, mid, right) merge_sort if left+1 < right:
        mid = (left + right) // 2
        merge_sort(A, left, mid)
        merge_sort(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 merge_sort(A, left, mid) merge_sort A left mid merge_sort(A, mid, right) merge_sort A mid right merge(A, left, mid, right) merge A left mid right A A left left right right def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid

    # リストの左側を作成
    L = A[left:mid]

    # リストの右側を作成
    R = A[mid:right]

    # 終端追加
    L.append(float("inf"))
    R.append(float("inf"))

    i = 0
    j = 0
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 merge global count n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = A[left:mid] L A[left:mid] A left:mid left mid R = A[mid:right] R A[mid:right] A mid:right mid right L.append(float("inf")) L.append L append float("inf") float "inf" R.append(float("inf")) R.append R append float("inf") float "inf" i = 0 i 0 j = 0 j 0 for k in range(left, right):
        count += 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 count += 1 count 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 if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main def main():
    input()
    A = [int(x) for x in list(input().split())]
    merge_sort(A, 0, len(A))
    print(*A)
    print(count) def main():
    input()
    A = [int(x) for x in list(input().split())]
    merge_sort(A, 0, len(A))
    print(*A)
    print(count) main count = 0 0 count def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid

    # リストの左側を作成
    L = A[left:mid]

    # リストの右側を作成
    R = A[mid:right]

    # 終端追加
    L.append(float("inf"))
    R.append(float("inf"))

    i = 0
    j = 0
    for k in range(left, right):
        count += 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):
    global count
    n1 = mid - left
    n2 = right - mid

    # リストの左側を作成
    L = A[left:mid]

    # リストの右側を作成
    R = A[mid:right]

    # 終端追加
    L.append(float("inf"))
    R.append(float("inf"))

    i = 0
    j = 0
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 merge def merge_sort(A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        merge_sort(A, left, mid)
        merge_sort(A, mid, right)
        merge(A, left, mid, right) def merge_sort(A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        merge_sort(A, left, mid)
        merge_sort(A, mid, right)
        merge(A, left, mid, right) merge_sort
count = 0


def main():
    input()
    A = [int(x) for x in list(input().split())]
    merge_sort(A, 0, len(A))
    print(*A)
    print(count)


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


def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid

    # リストの左側を作成
    L = A[left:mid]

    # リストの右側を作成
    R = A[mid:right]

    # 終端追加
    L.append(float("inf"))
    R.append(float("inf"))

    i = 0
    j = 0
    for k in range(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1


if __name__ == '__main__':
    main()

