#include <stdio.h>
int count=0;
void MergeSort(int x[],int left,int right){
  int mid,i,j,k,temp[n];
  if(left>=right) return;
  mid=(left+right)/2;
  MergeSort(x,left,mid);
  MergeSort(x,mid+1,right);
  for(i=left;i<=mid;i++){
    temp[i]=x[i];
  }
  for(i=mid+1,j=right;i<=right;i++,j--){
    temp[i]=x[j];
  }
  i=left;
  j=right;
  for(k=left;k<=right;k++){
    if(temp[i]<=temp[j]){
      x[k]=temp[i++];
    }
    else x[k]=temp[j--];
    count++;
  }
}
int main(){
  int i;
  scanf("%d",&n);
  int x[n];
  for(i=0;i<n;i++){
    scanf("%d",&x[i]);
  }
  MergeSort(x,0,n-1);
  for(i=0;i<n;i++){
    printf("%d",x[i]);
    if(i!=n-1){
      printf(" ");
    }
  }
  printf("\n%d\n",count);
  return 0;
}