#include<stdio.h>

#define N 500000
#define Keeper 100000

int count;

void MergeSort(int *,int,int);
void Merge(int *,int,int,int);

int main(){
  int loop;
  int i;
  int Retu[N];
  
  scanf(" %d",&loop);
  for(i=0;i<loop;i++){
    scanf(" %d",&Retu[i]);
  }

  MergeSort(Retu,0,loop);

  for(i=0;i<loop-1;i++){
    printf("%d ",Retu[i]);
  }
  
  printf("%d\n%d\n",Retu[loop-1],count);
  
  return 0;
}

void MergeSort(int *X,int lside,int rside){
  int center;
  
  if(lside+1<rside){
    center=(lside+rside)/2;
    MergeSort(X,lside,center);
    MergeSort(X,center,rside);
    Merge(X,lside,center,rside);
  }
}

void Merge(int *X,int lside,int center,int rside){
  int i,j,k;
  int Lreng,Rreng;
  int Left[N/2],Right[N/2];

  Lreng=center-lside;
  Rreng=rside-center;
  
  for(i=0;i<Lreng;i++){
    Left[i]=X[lside+i];
  }
  
  for(i=0;i<Rreng;i++){
    Right[i]=X[center+i];
  }

  Left[Lreng]=Keeper;
  Right[Rreng]=Keeper;

  i=0;
  j=0;

  for(k=lside;k<rside;k++){
    if(Left[i]<=Right[j]){
      X[k]=Left[i];
      i++;
      count++;
    }
    else{
      X[k]=Right[j];
      j++;
      count++;
    }
  }
 
}

