n = gets(chomp:true).to_i
s = gets.split.map(&:to_i)
@count = 0

def merge_s(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 << Float::INFINITY
  r << Float::INFINITY

  i, j = 0, 0

  (left...right).each do |k|

    @count += 1

    if l[i] <= r[j]
      a[k] = l[i]
      i += 1
    else
      a[k] = r[j]
      j += 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_s(a, left, mid, right)
  end
end

merge_sort(s, 0, n)
puts s.join(" ")
puts @count
