#include<stdio.h>
int count=0;
void Merge(int A[50000],int left,int mid,int right){
  int n1,n2,i,k,j;
  n1=mid-left;
  n2=right-mid;
  int L[n1+1],R[n2+1];
  for(i=0;i<n1;i++) L[i]=A[left+i];
  for(i=0;i<n2;i++) R[i]=A[mid+i];
    L[n1]=100000;
    R[n2]=100000;
  i=0;
  j=0;
  for(k=left;k<right;k++){
    if(L[i]<=R[j]){
      A[k]=L[i];
      i=i+1;
    }else{
      A[k]=R[j];
      j=j+1;
    }
    count++;

  }
}


void MergeSort(int A[50000],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);
  }else return;
}



int main(){
  int i,j,n,S[50000];
  
  scanf("%d",&n);
  for(i=0;i<n;i++) scanf("%d",&S[i]);
  MergeSort(S,0,n);
  for(i=0;i<n;i++){
    if(i==n-1)  printf("%d\n",S[i]);
    else  printf("%d ",S[i]);
  }
  printf("%d\n",count);  
  return 0;
}