#include <stdio.h>
#include <stdlib.h>

void mergeSort(int*,int,int);
void merge(int*,int,int,int);

int count=0;

int main(){
  int i,n,*S;

  scanf("%d",&n);
  S=(int*)malloc(sizeof(int)*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]);
    if(i<n-1)
      printf(" ");
  }
  printf("\n%d\n",count);
  return 0;
}

void mergeSort(int *A, int left, int right){
  int mid,i;
  if (left+1<right){
    mid = (left + right)/2;
    mergeSort(A, left, mid);
    mergeSort(A, mid, right);
    merge(A, left, mid, right);
  }
}

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