cnt = 0

def merge(A, left, mid, right):
    global cnt
    L, R = A[left:mid], A[mid:right]
    L.append(float('inf'))
    R.append(float('inf'))

    i, j = 0, 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_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 main():
    global cnt
    n = int(raw_input())
    A = map(int, raw_input().split())

    cnt = 0
    merge_sort(A, 0, n);

    print " ".join(map(str, A))
    print cnt


main() cnt = 0 cnt 0 def merge(A, left, mid, right):
    global cnt
    L, R = A[left:mid], A[mid:right]
    L.append(float('inf'))
    R.append(float('inf'))

    i, j = 0, 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 global cnt L, R = A[left:mid], A[mid:right] L A[left:mid] A left:mid left mid R A[mid:right] A mid:right mid right L.append(float('inf')) L.append L append float('inf') float 'inf' R.append(float('inf')) R.append R append float('inf') float 'inf' i, j = 0, 0 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 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 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 def main():
    global cnt
    n = int(raw_input())
    A = map(int, raw_input().split())

    cnt = 0
    merge_sort(A, 0, n);

    print " ".join(map(str, A))
    print cnt main global cnt n = int(raw_input()) n int(raw_input()) int raw_input() raw_input A = map(int, raw_input().split()) A map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split cnt = 0 cnt 0 merge_sort(A, 0, n) merge_sort A 0 n print " ".join(map(str, A)) " ".join " " join map(str, A) map str A print main() main 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 cnt = 0 0 cnt def main():
    global cnt
    n = int(raw_input())
    A = map(int, raw_input().split())

    cnt = 0
    merge_sort(A, 0, n);

    print " ".join(map(str, A))
    print cnt def main():
    global cnt
    n = int(raw_input())
    A = map(int, raw_input().split())

    cnt = 0
    merge_sort(A, 0, n);

    print " ".join(map(str, A))
    print cnt main def merge(A, left, mid, right):
    global cnt
    L, R = A[left:mid], A[mid:right]
    L.append(float('inf'))
    R.append(float('inf'))

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

    i, j = 0, 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
cnt = 0

def merge(A, left, mid, right):
    global cnt
    L, R = A[left:mid], A[mid:right]
    L.append(float('inf'))
    R.append(float('inf'))

    i, j = 0, 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_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 main():
    global cnt
    n = int(raw_input())
    A = map(int, raw_input().split())

    cnt = 0
    merge_sort(A, 0, n);

    print " ".join(map(str, A))
    print cnt


main()