N_MAX = 1000000000

n = int(input())
S = list(map(int, input().rstrip().split(" ")))

mergeCnt = 0

def merge(A, left, mid, right):
    
    global mergeCnt
    
    n1 = mid - left
    n2 = right - mid
    
    L = A[left:mid]
    R = A[mid:right]
    
    L.append(N_MAX)
    R.append(N_MAX)
    
    i = j = 0
    
    for k in range(left, right):
        mergeCnt += 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__'):
    
    left = 0
    right = n
    
    mergeSort(S, left,right)
    
    print(*S)
    print(mergeCnt) N_MAX = 1000000000 N_MAX 1000000000 n = int(input()) n int(input()) int input() input S = list(map(int, input().rstrip().split(" "))) S list(map(int, input().rstrip().split(" "))) list map(int, input().rstrip().split(" ")) map int input().rstrip().split(" ") ().rstrip().split ().rstrip() ().rstrip () input rstrip split " " mergeCnt = 0 mergeCnt 0 def merge(A, left, mid, right):
    
    global mergeCnt
    
    n1 = mid - left
    n2 = right - mid
    
    L = A[left:mid]
    R = A[mid:right]
    
    L.append(N_MAX)
    R.append(N_MAX)
    
    i = j = 0
    
    for k in range(left, right):
        mergeCnt += 1
        if(L[i] <= R[j]):
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 merge global mergeCnt n1 = mid - left n1 mid - left mid left n2 = right - mid n2 right - mid right mid 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(N_MAX) L.append L append N_MAX R.append(N_MAX) R.append R append N_MAX i = j = 0 i 0 = j = 0 j 0 for k in range(left, right):
        mergeCnt += 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 mergeCnt += 1 mergeCnt 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__'):
    
    left = 0
    right = n
    
    mergeSort(S, left,right)
    
    print(*S)
    print(mergeCnt) __name__ == '__main__' __name__ '__main__' left = 0 left 0 right = n right n mergeSort(S, left,right) mergeSort S left right print(*S) print *S S print(mergeCnt) print mergeCnt N_MAX = 1000000000 1000000000 N_MAX S = list(map(int, input().rstrip().split(" "))) list(map(int, input().rstrip().split(" "))) S mergeCnt = 0 0 mergeCnt def merge(A, left, mid, right):
    
    global mergeCnt
    
    n1 = mid - left
    n2 = right - mid
    
    L = A[left:mid]
    R = A[mid:right]
    
    L.append(N_MAX)
    R.append(N_MAX)
    
    i = j = 0
    
    for k in range(left, right):
        mergeCnt += 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 mergeCnt
    
    n1 = mid - left
    n2 = right - mid
    
    L = A[left:mid]
    R = A[mid:right]
    
    L.append(N_MAX)
    R.append(N_MAX)
    
    i = j = 0
    
    for k in range(left, right):
        mergeCnt += 1
        if(L[i] <= R[j]):
            A[k] = L[i]
            i += 1
        else:
            A[k] = R[j]
            j += 1 merge n = int(input()) int(input()) n left = 0 0 left 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 right = n n right
N_MAX = 1000000000

n = int(input())
S = list(map(int, input().rstrip().split(" ")))

mergeCnt = 0

def merge(A, left, mid, right):
    
    global mergeCnt
    
    n1 = mid - left
    n2 = right - mid
    
    L = A[left:mid]
    R = A[mid:right]
    
    L.append(N_MAX)
    R.append(N_MAX)
    
    i = j = 0
    
    for k in range(left, right):
        mergeCnt += 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__'):
    
    left = 0
    right = n
    
    mergeSort(S, left,right)
    
    print(*S)
    print(mergeCnt)
