inf = 10**9 + 7


def merge(A, left, mid, right):
    cnt = 0
    L = A[left:mid]
    R = A[mid:right]
    L.append(inf)
    R.append(inf)
    i, j = 0, 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
    return cnt


def merge_sort(A, left, right):
    cnt = 0
    if left + 1 < right:
        mid = (left + right) // 2
        cnt += merge_sort(A, left, mid)
        cnt += merge_sort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt


n = int(input())
*A, = map(int, input().split())
cnt = merge_sort(A, 0, n)
print(*A)
print(cnt) inf = 10**9 + 7 inf 10**9 + 7 10**9 10 9 7 def merge(A, left, mid, right):
    cnt = 0
    L = A[left:mid]
    R = A[mid:right]
    L.append(inf)
    R.append(inf)
    i, j = 0, 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
    return cnt merge cnt = 0 cnt 0 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(inf) L.append L append inf R.append(inf) R.append R append inf i, j = 0, 0 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
     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 return cnt cnt A A left left mid mid right right def merge_sort(A, left, right):
    cnt = 0
    if left + 1 < right:
        mid = (left + right) // 2
        cnt += merge_sort(A, left, mid)
        cnt += merge_sort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt merge_sort cnt = 0 cnt 0 if left + 1 < right:
        mid = (left + right) // 2
        cnt += merge_sort(A, left, mid)
        cnt += merge_sort(A, mid, right)
        cnt += 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 cnt += merge_sort(A, left, mid) cnt merge_sort(A, left, mid) merge_sort A left mid cnt += merge_sort(A, mid, right) cnt merge_sort(A, mid, right) merge_sort A mid right cnt += merge(A, left, mid, right) cnt merge(A, left, mid, right) merge A left mid right return cnt cnt A A left left right right n = int(input()) n int(input()) int input() input *A, = map(int, input().split()) *A A map(int, input().split()) map int input().split() ().split () input split cnt = merge_sort(A, 0, n) cnt merge_sort(A, 0, n) merge_sort A 0 n print(*A) print *A A print(cnt) print cnt def merge(A, left, mid, right):
    cnt = 0
    L = A[left:mid]
    R = A[mid:right]
    L.append(inf)
    R.append(inf)
    i, j = 0, 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
    return cnt def merge(A, left, mid, right):
    cnt = 0
    L = A[left:mid]
    R = A[mid:right]
    L.append(inf)
    R.append(inf)
    i, j = 0, 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
    return cnt merge n = int(input()) int(input()) n inf = 10**9 + 7 10**9 + 7 inf cnt = merge_sort(A, 0, n) merge_sort(A, 0, n) cnt def merge_sort(A, left, right):
    cnt = 0
    if left + 1 < right:
        mid = (left + right) // 2
        cnt += merge_sort(A, left, mid)
        cnt += merge_sort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt def merge_sort(A, left, right):
    cnt = 0
    if left + 1 < right:
        mid = (left + right) // 2
        cnt += merge_sort(A, left, mid)
        cnt += merge_sort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt merge_sort
inf = 10**9 + 7


def merge(A, left, mid, right):
    cnt = 0
    L = A[left:mid]
    R = A[mid:right]
    L.append(inf)
    R.append(inf)
    i, j = 0, 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
    return cnt


def merge_sort(A, left, right):
    cnt = 0
    if left + 1 < right:
        mid = (left + right) // 2
        cnt += merge_sort(A, left, mid)
        cnt += merge_sort(A, mid, right)
        cnt += merge(A, left, mid, right)
    return cnt


n = int(input())
*A, = map(int, input().split())
cnt = merge_sort(A, 0, n)
print(*A)
print(cnt)
