#include <stdio.h>
using namespace std;
#define MAX 500000
#define INFTY 2000000000

int L[(MAX/2)+2], R[(MAX/2)+2];
int count;


void merge(int A[],int n,int left,int mid,int right)
{
  int n1, n2, i, j, k;
    
  n1 = mid - left;
  n2 = right - mid;
  
  for(i=0;i<n1;i++){
    L[i] = A[left + i];
  }
  for(i=0;i<n2;i++){
    R[i] = A[mid + i];
  }
  
  L[n1] = INFTY;
  R[n2] = INFTY;
  i = 0;
  j = 0;
  
  for(k=left;k<right;k++){
    count++;
    if(L[i] <= R[j]){
      A[k] = L[i];
      i = i + 1;
    }
    else{
      A[k] = R[j];
      j = j + 1;
    }
  }
}


void mergeSort(int A[],int n,int left,int right)
{
  if(left+1 < right){
    mid = (left + right)/2;
    mergeSort(A, n, left, mid);
    mergeSort(A, n, mid, right);
    merge(A, n, left, mid, right);
  }
}


int main()
{

  int A[MAX], n, i;
  count = 0;

  count >> n;
  for(i=0;i<n;i++){
    cin >> A[i];
  }

  mergeSort(A,n,0,n);

  for(i=0;i<n;i++){
    if(i==1){
      cout << " ";
    }
      cout << A[i];
  }
    cout << end1;
    cout << count << end1;

    return 0;

}

