#include<stdio.h>
#define INFTY 1000000000

int count=0 ,A[50000];


void Merge(int left, int mid, int right){
  int n1 = mid - left;
  int n2 = right - mid;
  int L[n1], R[n2], i, j, k;

  for(i=0; i<=n1-1; i++){
    L[i] = A[left+i];
  }
  for(i=0; i<=n2-1; i++){
    R[i] = A[mid +i];
  }
  L[n1] = INFTY;
  R[n2] = INFTY;
  i = 0;
  j = 0;

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

void MergeSort(int left, int right){
  int mid;

  if(left+1 < right){
 mid = (left + right)/2;
 MergeSort(left, mid);
 MergeSort(mid, right);
 Merge(left, mid, right);
  }
}

int main(){
  int i,n;
  scanf("%d",&n);
  for(i=0; i<n; i++){
    scanf("%d",&A[i]);
  }
  MergeSort(0,n);
  for (i=0;i<n;i++){
    if(i!=0){
      printf(" ");
    }
    printf("%d",A[i]);
  }
  printf("\n%d\n",count);
  return 0;
}