MAX = 5 * 10**5
SENTINEL = 2 * 10**9
cnt = 0

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

    global cnt

    L.append(SENTINEL)
    R.append(SENTINEL)
    i = 0
    j = 0

    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):
    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()))
mergeSort(s, 0, len(s))

ans = []
for item in s:
    ans.append(str(item))
print(' '.join(ans))
print(cnt) MAX = 5 * 10**5 MAX 5 * 10**5 5 10**5 10 5 SENTINEL = 2 * 10**9 SENTINEL 2 * 10**9 2 10**9 10 9 cnt = 0 cnt 0 def merge(A, left, mid, right):
    n1 = mid - left;
    n2 = right - mid;
    L = A[left:left+n1]
    R = A[mid:mid+n2]

    global cnt

    L.append(SENTINEL)
    R.append(SENTINEL)
    i = 0
    j = 0

    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 n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = A[left:left+n1] L A[left:left+n1] A left:left+n1 left left+n1 left n1 R = A[mid:mid+n2] R A[mid:mid+n2] A mid:mid+n2 mid mid+n2 mid n2 global cnt L.append(SENTINEL) L.append L append SENTINEL R.append(SENTINEL) R.append R append SENTINEL i = 0 i 0 j = 0 j 0 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):
    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 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, len(s)) mergeSort s 0 len(s) len s ans = [] ans [] for item in s:
    ans.append(str(item)) item s ans.append(str(item)) ans.append ans append str(item) str item print(' '.join(ans)) print ' '.join(ans) ' '.join ' ' join ans print(cnt) print cnt cnt = 0 0 cnt s = list(map(int, input().split())) list(map(int, input().split())) s 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 ans = [] [] ans MAX = 5 * 10**5 5 * 10**5 MAX def merge(A, left, mid, right):
    n1 = mid - left;
    n2 = right - mid;
    L = A[left:left+n1]
    R = A[mid:mid+n2]

    global cnt

    L.append(SENTINEL)
    R.append(SENTINEL)
    i = 0
    j = 0

    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):
    n1 = mid - left;
    n2 = right - mid;
    L = A[left:left+n1]
    R = A[mid:mid+n2]

    global cnt

    L.append(SENTINEL)
    R.append(SENTINEL)
    i = 0
    j = 0

    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 n = int(input()) int(input()) n SENTINEL = 2 * 10**9 2 * 10**9 SENTINEL
MAX = 5 * 10**5
SENTINEL = 2 * 10**9
cnt = 0

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

    global cnt

    L.append(SENTINEL)
    R.append(SENTINEL)
    i = 0
    j = 0

    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):
    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()))
mergeSort(s, 0, len(s))

ans = []
for item in s:
    ans.append(str(item))
print(' '.join(ans))
print(cnt)
