INF = 0xffffffff
$cnt = 0

def merge(a, left, mid, right)
  n1 = mid - left
  n2 = right - mid
  l = Array.new(n1)
  r = Array.new(n2)
  (0...n1).each do |i|
    l[i] = a[left + i]
  end
  (0...n2).each do |i|
    r[i] = a[mid + i]
  end
  l[n1] = INF
  r[n2] = INF
  i = 0
  j = 0
  (left...right).each do |k|
    if l[i] <= r[j] 
      a[k] = l[i]
      i += 1
      $cnt += 1
    else
      a[k] = r[j]
      j += 1
      $cnt += 1
    end
  end
end


def merge_sort(a, left, right) 
  if left+1 < right
    mid = (left + right) / 2
    merge_sort(a, left, mid)
    merge_sort(a, mid, right)
    merge(a, left, mid, right)
  end
end

n = gets.to_i
a = gets.split.map(&:to_i)

merge_sort(a, 0, n)

puts a.join(" ")
puts $cnt