# merge_sort
# 1. divide
# 2. solve
# 3. conquer

n = gets.to_i
@arr = gets.split.map(&:to_i)
@count = 0
@L = []
@R = []
SENTINEL = 20000000000.freeze

def merge(n, left, mid, right)
  n1 = mid - left
  n2 = right - mid
  n1.times do |i|
    @L[i] = @arr[left + i]
  end
  
  n2.times do |i|
    @R[i] = @arr[mid + i]
  end
  
  @L[n1] = SENTINEL
  @R[n2] = SENTINEL
  
  i = 0
  j = 0
  (left...right).each do |k|
    @count += 1
    
    if @L[i] <= @R[j]
      @arr[k] = @L[i]
      i += 1
    else
      @arr[k] = @R[j]
      j += 1
    end
  end
end

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

merge_sort(n, 0, n)

@arr.each_with_index do |v, idx|
  print " " if idx > 0
  print v
end

print "\n"
puts @count
