#include <stdio.h>

#define INFTY 1000000000

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

int S[500000],L[250000],R[250000];
int count;

int main(){
  
  int n,i;

  scanf("%d",&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");
  printf("%d\n",count);
    
  
  return 0;

}

void merge(int A[],int left,int mid,int right){

  int n1,n2,i,k,j;
  
  n1 = mid - left;
  n2 = right - mid;
  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;k++){
    if (L[i] <= R[j]){
      A[k] = L[i];
      i = i + 1;
    }
    else{ 
      A[k] = R[j];
      j = j + 1;
    }
    count++;
  }
}

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