def merge(A, left, mid, right, c):
    global counter
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
    R = [0] * (n2+1)
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 1000000000
    R[n2] = 1000000000
    i = 0
    j = 0
    for k in range(left,right):
        c += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else : 
            A[k] = R[j]
            j += 1
    L.pop()
    R.pop()
    return c

def mergeSort(A, left, right, c):
    if left+1 < right:
        mid = int((left + right)/2)
        c = mergeSort(A, left, mid, c)
        c = mergeSort(A, mid, right, c)
        c = merge(A, left, mid, right, c)
    return c

if __name__ == '__main__':
    num = int(input())
    m = list(map(int,input().split()))
    c = 0
    c = mergeSort(m, 0, num, c)
    print(' '.join(map(str,m)))
    print(str(c)) def merge(A, left, mid, right, c):
    global counter
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
    R = [0] * (n2+1)
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 1000000000
    R[n2] = 1000000000
    i = 0
    j = 0
    for k in range(left,right):
        c += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else : 
            A[k] = R[j]
            j += 1
    L.pop()
    R.pop()
    return c merge global counter n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid L = [0] * (n1+1) L [0] * (n1+1) [0] 0 n1+1 n1 1 R = [0] * (n2+1) R [0] * (n2+1) [0] 0 n2+1 n2 1 for i in range(n1):
        L[i] = A[left + i]
     i range(n1) range n1 L[i] = A[left + i] L[i] L i A[left + i] A left + i left i for i in range(n2):
        R[i] = A[mid + i]
     i range(n2) range n2 R[i] = A[mid + i] R[i] R i A[mid + i] A mid + i mid i L[n1] = 1000000000 L[n1] L n1 1000000000 R[n2] = 1000000000 R[n2] R n2 1000000000 i = 0 i 0 j = 0 j 0 for k in range(left,right):
        c += 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 c += 1 c 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 L.pop() L.pop L pop R.pop() R.pop R pop return c c A A left left mid mid right right c c def mergeSort(A, left, right, c):
    if left+1 < right:
        mid = int((left + right)/2)
        c = mergeSort(A, left, mid, c)
        c = mergeSort(A, mid, right, c)
        c = merge(A, left, mid, right, c)
    return c mergeSort if left+1 < right:
        mid = int((left + right)/2)
        c = mergeSort(A, left, mid, c)
        c = mergeSort(A, mid, right, c)
        c = merge(A, left, mid, right, c)
     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 c = mergeSort(A, left, mid, c) c mergeSort(A, left, mid, c) mergeSort A left mid c c = mergeSort(A, mid, right, c) c mergeSort(A, mid, right, c) mergeSort A mid right c c = merge(A, left, mid, right, c) c merge(A, left, mid, right, c) merge A left mid right c return c c A A left left right right c c if __name__ == '__main__':
    num = int(input())
    m = list(map(int,input().split()))
    c = 0
    c = mergeSort(m, 0, num, c)
    print(' '.join(map(str,m)))
    print(str(c)) __name__ == '__main__' __name__ '__main__' num = int(input()) num int(input()) int input() input m = list(map(int,input().split())) m list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split c = 0 c 0 c = mergeSort(m, 0, num, c) c mergeSort(m, 0, num, c) mergeSort m 0 num c print(' '.join(map(str,m))) print ' '.join(map(str,m)) ' '.join ' ' join map(str,m) map str m print(str(c)) print str(c) str c def merge(A, left, mid, right, c):
    global counter
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
    R = [0] * (n2+1)
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 1000000000
    R[n2] = 1000000000
    i = 0
    j = 0
    for k in range(left,right):
        c += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else : 
            A[k] = R[j]
            j += 1
    L.pop()
    R.pop()
    return c def merge(A, left, mid, right, c):
    global counter
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
    R = [0] * (n2+1)
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 1000000000
    R[n2] = 1000000000
    i = 0
    j = 0
    for k in range(left,right):
        c += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else : 
            A[k] = R[j]
            j += 1
    L.pop()
    R.pop()
    return c merge num = int(input()) int(input()) num c = 0 0 c m = list(map(int,input().split())) list(map(int,input().split())) m def mergeSort(A, left, right, c):
    if left+1 < right:
        mid = int((left + right)/2)
        c = mergeSort(A, left, mid, c)
        c = mergeSort(A, mid, right, c)
        c = merge(A, left, mid, right, c)
    return c def mergeSort(A, left, right, c):
    if left+1 < right:
        mid = int((left + right)/2)
        c = mergeSort(A, left, mid, c)
        c = mergeSort(A, mid, right, c)
        c = merge(A, left, mid, right, c)
    return c mergeSort c = mergeSort(m, 0, num, c) mergeSort(m, 0, num, c) c
def merge(A, left, mid, right, c):
    global counter
    n1 = mid - left
    n2 = right - mid
    L = [0] * (n1+1)
    R = [0] * (n2+1)
    for i in range(n1):
        L[i] = A[left + i]
    for i in range(n2):
        R[i] = A[mid + i]
    L[n1] = 1000000000
    R[n2] = 1000000000
    i = 0
    j = 0
    for k in range(left,right):
        c += 1
        if L[i] <= R[j]:
            A[k] = L[i]
            i += 1
        else : 
            A[k] = R[j]
            j += 1
    L.pop()
    R.pop()
    return c

def mergeSort(A, left, right, c):
    if left+1 < right:
        mid = int((left + right)/2)
        c = mergeSort(A, left, mid, c)
        c = mergeSort(A, mid, right, c)
        c = merge(A, left, mid, right, c)
    return c

if __name__ == '__main__':
    num = int(input())
    m = list(map(int,input().split()))
    c = 0
    c = mergeSort(m, 0, num, c)
    print(' '.join(map(str,m)))
    print(str(c))
