#include<stdio.h>
#include<math.h>
#define N 500000
#define INFTY INFINITY

int cnt;
void merge(int A[],int left,int mid,int right);
void mergeSort(int A[],int left,int right);

int main(){
  int S[N],i,n;

  scanf("%d",&n);

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

   for(i=0; i<n; i++)
    i<n-1 ? printf("%d ",S[i]) : printf("%d\n",S[i]);
 
  printf("%d\n",cnt);

  
  return 0;
}

void merge(int A[],int left,int mid,int right){
  int n1,n2,k,i,j;
  int L[N],R[N];
  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[i+mid];
  }
  L[n1]=INFTY;
  L[n2]=INFTY;
  i=0;
  j=0;

  for(k=left;k<right;k++){
    cnt++;
    if(L[i]<=R[j]){
      A[k]=L[i];
      i=i+1;
    }
    else {
      A[k]=R[j];
      j=j+1;
    }
  }

}

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);
  }


}

