cnt = 0

def merge(A, left, mid, right):
    global cnt

    L = A[left:mid]
    R = A[mid:right]
    L.append(10000000000)
    R.append(10000000000)

    i = 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
        cnt += 1

def mergesort(A, left, right):
    if left + 1 < right: #if block size >= 2
        mid = int((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, n)
print(*S)
print(str(cnt)) cnt = 0 cnt 0 def merge(A, left, mid, right):
    global cnt

    L = A[left:mid]
    R = A[mid:right]
    L.append(10000000000)
    R.append(10000000000)

    i = 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
        cnt += 1 merge global cnt 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(10000000000) L.append L append 10000000000 R.append(10000000000) R.append R append 10000000000 i = 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
        cnt += 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 cnt += 1 cnt 1 A A left left mid mid right right def mergesort(A, left, right):
    if left + 1 < right: #if block size >= 2
        mid = int((left + right)/2)
        mergesort(A, left, mid)
        mergesort(A, mid, right)
        merge(A, left, mid, right)
         mergesort if left + 1 < right: #if block size >= 2
        mid = int((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 = int((left + right)/2) mid int((left + right)/2) int (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, n) mergesort S 0 n print(*S) print *S S print(str(cnt)) print str(cnt) str cnt cnt = 0 0 cnt n = int(input()) int(input()) n S = list(map(int,input().split())) list(map(int,input().split())) S def mergesort(A, left, right):
    if left + 1 < right: #if block size >= 2
        mid = int((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: #if block size >= 2
        mid = int((left + right)/2)
        mergesort(A, left, mid)
        mergesort(A, mid, right)
        merge(A, left, mid, right)
         mergesort def merge(A, left, mid, right):
    global cnt

    L = A[left:mid]
    R = A[mid:right]
    L.append(10000000000)
    R.append(10000000000)

    i = 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
        cnt += 1 def merge(A, left, mid, right):
    global cnt

    L = A[left:mid]
    R = A[mid:right]
    L.append(10000000000)
    R.append(10000000000)

    i = 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
        cnt += 1 merge
cnt = 0

def merge(A, left, mid, right):
    global cnt

    L = A[left:mid]
    R = A[mid:right]
    L.append(10000000000)
    R.append(10000000000)

    i = 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
        cnt += 1

def mergesort(A, left, right):
    if left + 1 < right: #if block size >= 2
        mid = int((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, n)
print(*S)
print(str(cnt))
