#include <stdio.h>
#define N 500000
#define INF 2000000000
int S[INF];
int count=0;
void merge(int[],int,int,int);
void mergeSort(int[],int ,int);
int main()
{
  int i,n;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&S[i]);
  }
  mergeSort(S,0,n);
  for(i =0;i<n-1;i++){
    printf("%d ",S[i]);
  }
  printf("%d\n%d\n",S[i],count);
  return 0;
}
void merge(int S[],int left,int mid,int right){
  int n1,n2;
  int i,j,k;
  int L[N],R[N];
  n1= mid-left;
  n2=right-mid;
  for(i=0;i<n1;i++){
    L[i]=S[left +i];
  }
  for(j=0;j<n2;j++){
    R[j]=S[mid+j];
  }
    L[n1]=INF;
    R[n2]=INF;
    i=0;
    j=0;
  
  for(k=left;k<right;k++){
    count++;
    if(L[i]<R[j]){
      S[k]=L[i];
      i=i+1;
    }
      else {
      S[k]=R[j];
      j=j+1;
      }
  }
}

void mergeSort(int S[],int left,int right){
  int mid;
  if(left+1<right){
    mid = (left + right)/2;
    mergeSort(S,left,mid);
    mergeSort(S,mid,right);
    merge(S,left,mid,right);
  }
}