#!/usr/bin/ruby
# -*- coding: utf-8 -*-
=begin
ALDS1_5-B

Recursion / Divide and Conquer - Merge Sort
Merge Sort

=end

class Merge
  def merge(a, left, mid, right)
    sentinel = 999999;
    n1 = mid - left;
    n2 = right - mid;
    l = Array.new(n1+1);
    r = Array.new(n2+1);

    0.upto(n1-1) {|i|
      l[i] = a[left + i]
    }
    0.upto(n2-1) {|i|
      r[i] = a[mid + i]
    }
    l[n1] = sentinel;
    r[n2] = sentinel;
    i = 0;
    j = 0;
    q = 0;
    left.upto(right-1) {|k|
      q = q + 1;
      if (l[i] <= r[j]) then
        a[k] = l[i];
        i = i + 1;
      else
        a[k] = r[j];
        j = j + 1;
      end
    }
    return q;
  end

  def mergeSort(a, left, right)
    if left + 1 < right then
      mid = (left + right)/2
      n1 = mergeSort(a, left, mid)
      n2 = mergeSort(a, mid, right)
      n3 = merge(a, left, mid, right)
      return n1+n2+n3
    else
      return 0
    end
  end

end

class Main

  def initialize()
    #fh = open("/home/muz/Downloads/ALDS1_5_B_in1.txt")
    fh = STDIN
    n = fh.gets.to_i
    a = fh.gets.chomp.split.map{|x| x.to_i}
    ms = Merge.new

    q1 = ms.mergeSort(a, 0, n)

    puts a.map{|x| x.to_s}.join(" ")
    puts q1
  end

end

if $0 == __FILE__ then
  Main.new
end