n = int(input())
A = list(map(int, input().split()))
INF = (10 ** 9) * 2
count = 0


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

    L = [0] * (n1 + 1)
    R = [0] * (n2 + 1)

    for i in range(n1):
        L[i] = A[left + i]

    for i in range(n2):
        R[i] = A[mid + i]

    L[n1] = INF
    R[n2] = INF

    i = 0
    j = 0

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

    return count


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


count = mergesort(0, len(A))

print(*A)
print(count)
 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 INF = (10 ** 9) * 2 INF (10 ** 9) * 2 10 ** 9 10 9 2 count = 0 count 0 def merge(left, mid, right):
    n1 = mid - left
    n2 = right - mid

    L = [0] * (n1 + 1)
    R = [0] * (n2 + 1)

    for i in range(n1):
        L[i] = A[left + i]

    for i in range(n2):
        R[i] = A[mid + i]

    L[n1] = INF
    R[n2] = INF

    i = 0
    j = 0

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

    return count merge n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = [0] * (n1 + 1) L [0] * (n1 + 1) [0] 0 n1 + 1 n1 1 R = [0] * (n2 + 1) R [0] * (n2 + 1) [0] 0 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] = INF L[n1] L n1 INF R[n2] = INF R[n2] R n2 INF i = 0 i 0 j = 0 j 0 count = 0 count 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 return count count left left mid mid right right def mergesort(left, right):
    if left + 1 < right:
        mid = (left + right) // 2
        count = 0
        count += mergesort(left, mid)
        count += mergesort(mid, right)
        return count + merge(left, mid, right)
    return 0 mergesort if left + 1 < right:
        mid = (left + right) // 2
        count = 0
        count += mergesort(left, mid)
        count += mergesort(mid, right)
        return count + merge(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 = 0 count 0 count += mergesort(left, mid) count mergesort(left, mid) mergesort left mid count += mergesort(mid, right) count mergesort(mid, right) mergesort mid right return count + merge(left, mid, right) count + merge(left, mid, right) count merge(left, mid, right) merge left mid right return 0 0 left left right right count = mergesort(0, len(A)) count mergesort(0, len(A)) mergesort 0 len(A) len A print(*A) print *A A print(count) print count INF = (10 ** 9) * 2 (10 ** 9) * 2 INF n = int(input()) int(input()) n count = 0 0 count def merge(left, mid, right):
    n1 = mid - left
    n2 = right - mid

    L = [0] * (n1 + 1)
    R = [0] * (n2 + 1)

    for i in range(n1):
        L[i] = A[left + i]

    for i in range(n2):
        R[i] = A[mid + i]

    L[n1] = INF
    R[n2] = INF

    i = 0
    j = 0

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

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

    L = [0] * (n1 + 1)
    R = [0] * (n2 + 1)

    for i in range(n1):
        L[i] = A[left + i]

    for i in range(n2):
        R[i] = A[mid + i]

    L[n1] = INF
    R[n2] = INF

    i = 0
    j = 0

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

    return count merge def mergesort(left, right):
    if left + 1 < right:
        mid = (left + right) // 2
        count = 0
        count += mergesort(left, mid)
        count += mergesort(mid, right)
        return count + merge(left, mid, right)
    return 0 def mergesort(left, right):
    if left + 1 < right:
        mid = (left + right) // 2
        count = 0
        count += mergesort(left, mid)
        count += mergesort(mid, right)
        return count + merge(left, mid, right)
    return 0 mergesort A = list(map(int, input().split())) list(map(int, input().split())) A count = mergesort(0, len(A)) mergesort(0, len(A)) count
n = int(input())
A = list(map(int, input().split()))
INF = (10 ** 9) * 2
count = 0


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

    L = [0] * (n1 + 1)
    R = [0] * (n2 + 1)

    for i in range(n1):
        L[i] = A[left + i]

    for i in range(n2):
        R[i] = A[mid + i]

    L[n1] = INF
    R[n2] = INF

    i = 0
    j = 0

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

    return count


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


count = mergesort(0, len(A))

print(*A)
print(count)

