#include <stdio.h>
#define MAX 5000000
#define INFTY 1000000000
int cnt=0;
int L[MAX/2+2],R[MAX/2+2];
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++){
  cnt++;
if(L[i]<=R[i]){
   A[k]=L[i++];
  }
 else{
   A[k]=R[j++];
    }
   }
}
void  mergeSort(int A[],int n, int left, int right){
int mid;
   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 i,j,A[MAX],n;

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

for(i=0;i<n;i++){
  if(i<n) printf(" ");
  printf("%d",A[i]);
}
  printf("\n");
  printf("%d\n",cnt);

return 0;



}

