def merge(arr,left,mid,right)
  n1=mid-left
  n2=right-mid
  larr=Array.new()
  rarr=Array.new()
  0.upto(n1-1) do |i|
    larr[i]=arr[left+i]
  end
  0.upto(n2-1) do |i|
    rarr[i]=arr[mid+i]
  end
  larr[n1]=1000000000
  rarr[n2]=1000000000
  i=0
  j=0
  left.upto(right-1) do |k|
    if larr[i] <= rarr[j]
      arr[k]=larr[i]
      i=i+1
      @count+=1
    else
      arr[k]=rarr[j]
      j=j+1
      @count+=1
    end
  end
end

def mergeSort(arr,left,right)
  if left+1 < right
    mid=(left+right)/2
    mergeSort(arr,left,mid)
    mergeSort(arr,mid,right)
    merge(arr,left,mid,right)
  else
    return arr
  end
end

n=gets.to_i
arr=gets.split.map(&:to_i)
@count=0
mergeSort(arr,0,n)
puts arr.join(' ')
puts @count