# coding: utf-8
# Here your code !
count=0

def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid
    L = [0 for i in xrange(n1 + 1)]
    R = [0 for i in xrange(n2 + 1)]
    for i in xrange(n1):
        L[i] = A[left + i]
    for i in xrange(n2):
        R[i] = A[mid + i]
    L[n1] = 1<<32 - 1
    R[n2] = 1<<32 - 1
    i = 0
    j = 0
    for k in xrange(left, right):
        count += 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)
        
if __name__ == "__main__":
    n = int(raw_input())
    refA = map(int, raw_input().split())
    A = list(refA)
    mergeSort(A, 0, n)
    print " ".join(map(str,A))
    print count  count=0 count 0 def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid
    L = [0 for i in xrange(n1 + 1)]
    R = [0 for i in xrange(n2 + 1)]
    for i in xrange(n1):
        L[i] = A[left + i]
    for i in xrange(n2):
        R[i] = A[mid + i]
    L[n1] = 1<<32 - 1
    R[n2] = 1<<32 - 1
    i = 0
    j = 0
    for k in xrange(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 merge global count n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid 0 for i in xrange(n1 + 1) for i in xrange(n1 + 1) i xrange(n1 + 1) xrange n1 + 1 n1 1 for i in xrange(n1 + 1) 0 L = [0 for i in xrange(n1 + 1)] L [0 for i in xrange(n1 + 1)] 0 for i in xrange(n2 + 1) for i in xrange(n2 + 1) i xrange(n2 + 1) xrange n2 + 1 n2 1 for i in xrange(n2 + 1) 0 R = [0 for i in xrange(n2 + 1)] R [0 for i in xrange(n2 + 1)] for i in xrange(n1):
        L[i] = A[left + i]
     i xrange(n1) xrange n1 L[i] = A[left + i] L[i] L i A[left + i] A left + i left i for i in xrange(n2):
        R[i] = A[mid + i]
     i xrange(n2) xrange n2 R[i] = A[mid + i] R[i] R i A[mid + i] A mid + i mid i L[n1] = 1<<32 - 1 L[n1] L n1 1<<32 - 1 1 32 - 1 32 1 R[n2] = 1<<32 - 1 R[n2] R n2 1<<32 - 1 1 32 - 1 32 1 i = 0 i 0 j = 0 j 0 for k in xrange(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 k xrange(left, right) xrange left right count += 1 count 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 if __name__ == "__main__":
    n = int(raw_input())
    refA = map(int, raw_input().split())
    A = list(refA)
    mergeSort(A, 0, n)
    print " ".join(map(str,A))
    print count  __name__ == "__main__" __name__ "__main__" n = int(raw_input()) n int(raw_input()) int raw_input() raw_input refA = map(int, raw_input().split()) refA map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split A = list(refA) A list(refA) list refA mergeSort(A, 0, n) mergeSort A 0 n print " ".join(map(str,A)) " ".join " " join map(str,A) map str A print A = list(refA) list(refA) A refA = map(int, raw_input().split()) map(int, raw_input().split()) refA count=0 0 count def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid
    L = [0 for i in xrange(n1 + 1)]
    R = [0 for i in xrange(n2 + 1)]
    for i in xrange(n1):
        L[i] = A[left + i]
    for i in xrange(n2):
        R[i] = A[mid + i]
    L[n1] = 1<<32 - 1
    R[n2] = 1<<32 - 1
    i = 0
    j = 0
    for k in xrange(left, right):
        count += 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 count
    n1 = mid - left
    n2 = right - mid
    L = [0 for i in xrange(n1 + 1)]
    R = [0 for i in xrange(n2 + 1)]
    for i in xrange(n1):
        L[i] = A[left + i]
    for i in xrange(n2):
        R[i] = A[mid + i]
    L[n1] = 1<<32 - 1
    R[n2] = 1<<32 - 1
    i = 0
    j = 0
    for k in xrange(left, right):
        count += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 merge 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 n = int(raw_input()) int(raw_input()) n
# coding: utf-8
# Here your code !
count=0

def merge(A, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid
    L = [0 for i in xrange(n1 + 1)]
    R = [0 for i in xrange(n2 + 1)]
    for i in xrange(n1):
        L[i] = A[left + i]
    for i in xrange(n2):
        R[i] = A[mid + i]
    L[n1] = 1<<32 - 1
    R[n2] = 1<<32 - 1
    i = 0
    j = 0
    for k in xrange(left, right):
        count += 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)
        
if __name__ == "__main__":
    n = int(raw_input())
    refA = map(int, raw_input().split())
    A = list(refA)
    mergeSort(A, 0, n)
    print " ".join(map(str,A))
    print count 