#include <stdio.h>
void merge(int [],int,int,int);
void mergeSort(int [],int,int);
int cnt;
int main(){
  int S[1000000],i,n;
  scanf("%d",&n);
 
  for(i=0;i<n;i++){
    scanf("%d",&S[i]);
  }
 
  mergeSort(S,0,n);

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

  return 0;
}

void merge(int A[],int left,int mid,int right){
  int n1,n2,i,j,k;
  double L[1000],R[1000];

  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]=1.0/0.0;
  R[n2]=1.0/0.0;
  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);
  }

}