#include<stdio.h>

int snl=1000000;
int cnt=0;

void Merge(int *A,int left,int mid,int right) {
  
  int i,j,k,n1,n2;
  
  int L[10000],R[10000];
  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] = snl;
  R[n2] = snl;
  
  i=0;
  j=0;
  for(k=left;k<right;k++) {
    cnt++;  
    if(L[i] <= R[j]) {
    A[k] = L[i];
    i++;
  }    
  else A[k] = R[j];
  j++;    
  }

}
void MergeSort(int *A,int left,int right) {

  int mid;

  if(left + 1< right) {
    mid = (left + right) /2;
    MergeSort(A,left,mid);
    MergeSort(A,mid,right);
    Merge(A,left,mid,right); 
 }
}

 

int main(void) {

  int i,n,A[10000];

  scanf("%d",&n);
 
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }
  MergeSort(A,0,n);
  for(i=0;i<n;i++){
   printf("%d ",A[i]);
  }

  printf("\n%d\n",cnt); 
  return 0;
}
 