import sys

input = sys.stdin.readline

MAX = 500000
GUARD = 2000000000
cnt = 0

def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid] + [MAX]
    R = A[mid:right] + [MAX]

    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    
    L[n1] = GUARD
    R[n2] = GUARD
    i = 0
    j = 0

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

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

def main():
    n = int(input())
    S = list(map(int, input().split()))

    mergeSort(S, 0, n)

    print(*S)
    print(cnt)
             
if __name__ == "__main__":
    main() import sys sys input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline MAX = 500000 MAX 500000 GUARD = 2000000000 GUARD 2000000000 cnt = 0 cnt 0 def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid] + [MAX]
    R = A[mid:right] + [MAX]

    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    
    L[n1] = GUARD
    R[n2] = GUARD
    i = 0
    j = 0

    global cnt
    for k in range(left, right):
        cnt += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i + 1
        else:
            A[k] = R[j]
            j = j + 1 merge n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = A[left:mid] + [MAX] L A[left:mid] + [MAX] A[left:mid] A left:mid left mid [MAX] MAX R = A[mid:right] + [MAX] R A[mid:right] + [MAX] A[mid:right] A mid:right mid right [MAX] MAX 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] = GUARD L[n1] L n1 GUARD R[n2] = GUARD R[n2] R n2 GUARD 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 = i + 1
        else:
            A[k] = R[j]
            j = j + 1 k range(left, right) range left right cnt += 1 cnt 1 if L[i] <= R[j]:
            A[k] = L[i]
            i = i + 1
        else:
            A[k] = R[j]
            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 = i + 1 i i + 1 i 1 A[k] = R[j] A[k] A k R[j] R j j = j + 1 j j + 1 j 1 A A left left mid mid right right def mergeSort(A, left, right):
    if left+1 < right:
        mid = (left + right) // 2
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right) mergeSort 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 def main():
    n = int(input())
    S = list(map(int, input().split()))

    mergeSort(S, 0, n)

    print(*S)
    print(cnt)
              main 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 mergeSort(S, 0, n) mergeSort S 0 n print(*S) print *S S print(cnt) print cnt if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main cnt = 0 0 cnt GUARD = 2000000000 2000000000 GUARD def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid] + [MAX]
    R = A[mid:right] + [MAX]

    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    
    L[n1] = GUARD
    R[n2] = GUARD
    i = 0
    j = 0

    global cnt
    for k in range(left, right):
        cnt += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i + 1
        else:
            A[k] = R[j]
            j = j + 1 def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid] + [MAX]
    R = A[mid:right] + [MAX]

    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    
    L[n1] = GUARD
    R[n2] = GUARD
    i = 0
    j = 0

    global cnt
    for k in range(left, right):
        cnt += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i + 1
        else:
            A[k] = R[j]
            j = j + 1 merge MAX = 500000 500000 MAX input = sys.stdin.readline sys.stdin.readline input def mergeSort(A, left, right):
    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):
    if left+1 < right:
        mid = (left + right) // 2
        mergeSort(A, left, mid)
        mergeSort(A, mid, right)
        merge(A, left, mid, right) mergeSort def main():
    n = int(input())
    S = list(map(int, input().split()))

    mergeSort(S, 0, n)

    print(*S)
    print(cnt)
              def main():
    n = int(input())
    S = list(map(int, input().split()))

    mergeSort(S, 0, n)

    print(*S)
    print(cnt)
              main
import sys

input = sys.stdin.readline

MAX = 500000
GUARD = 2000000000
cnt = 0

def merge(A, left, mid, right):
    n1 = mid - left
    n2 = right - mid
    L = A[left:mid] + [MAX]
    R = A[mid:right] + [MAX]

    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    
    L[n1] = GUARD
    R[n2] = GUARD
    i = 0
    j = 0

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

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

def main():
    n = int(input())
    S = list(map(int, input().split()))

    mergeSort(S, 0, n)

    print(*S)
    print(cnt)
             
if __name__ == "__main__":
    main()
