num = int(input())
s = list(map(int, input().split()))
cnt = 0

def merge(A, left, mid, right):
    global cnt
    
    L = A[left:mid] + [10**9 + 1]
    R = A[mid:right] + [10**9 + 1]
    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 += right - left

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(s, 0, num)

print(*s)
print(cnt) num = int(input()) num 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 cnt = 0 cnt 0 def merge(A, left, mid, right):
    global cnt
    
    L = A[left:mid] + [10**9 + 1]
    R = A[mid:right] + [10**9 + 1]
    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 += right - left merge global cnt L = A[left:mid] + [10**9 + 1] L A[left:mid] + [10**9 + 1] A[left:mid] A left:mid left mid [10**9 + 1] 10**9 + 1 10**9 10 9 1 R = A[mid:right] + [10**9 + 1] R A[mid:right] + [10**9 + 1] A[mid:right] A mid:right mid right [10**9 + 1] 10**9 + 1 10**9 10 9 1 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
     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 += right - left cnt right - left right left A A left left mid mid right 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 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 merge_sort(s, 0, num) merge_sort s 0 num print(*s) print *s s print(cnt) print cnt cnt = 0 0 cnt def merge(A, left, mid, right):
    global cnt
    
    L = A[left:mid] + [10**9 + 1]
    R = A[mid:right] + [10**9 + 1]
    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 += right - left def merge(A, left, mid, right):
    global cnt
    
    L = A[left:mid] + [10**9 + 1]
    R = A[mid:right] + [10**9 + 1]
    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 += right - left 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 s = list(map(int, input().split())) list(map(int, input().split())) s num = int(input()) int(input()) num
num = int(input())
s = list(map(int, input().split()))
cnt = 0

def merge(A, left, mid, right):
    global cnt
    
    L = A[left:mid] + [10**9 + 1]
    R = A[mid:right] + [10**9 + 1]
    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 += right - left

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(s, 0, num)

print(*s)
print(cnt)
