n=int(input())
cnt=0
a=list(map(int,input().split()))

def Merge(A, left, mid, right):
	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] = 10**10
	R[n2] = 10**10
	i = 0
	j = 0
	global cnt
	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 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(a,0,n)
print(*a)
print(cnt)



 n=int(input()) n int(input()) int input() input cnt=0 cnt 0 a=list(map(int,input().split())) a list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split def Merge(A, left, mid, right):
	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] = 10**10
	R[n2] = 10**10
	i = 0
	j = 0
	global cnt
	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 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] = 10**10 L[n1] L n1 10**10 10 10 R[n2] = 10**10 R[n2] R n2 10**10 10 10 i = 0 i 0 j = 0 j 0 global cnt 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 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 MergeSort(a,0,n) MergeSort a 0 n print(*a) print *a a print(cnt) print cnt a=list(map(int,input().split())) list(map(int,input().split())) a 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 def Merge(A, left, mid, right):
	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] = 10**10
	R[n2] = 10**10
	i = 0
	j = 0
	global cnt
	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):
	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] = 10**10
	R[n2] = 10**10
	i = 0
	j = 0
	global cnt
	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 0 cnt n=int(input()) int(input()) n
n=int(input())
cnt=0
a=list(map(int,input().split()))

def Merge(A, left, mid, right):
	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] = 10**10
	R[n2] = 10**10
	i = 0
	j = 0
	global cnt
	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 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(a,0,n)
print(*a)
print(cnt)




