#include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000

int L[(MAX/2)+2];
int R[(MAX/2)+2];
int count;

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

int main(){
  int A[MAX];
  int n, i;
  
  count = 0;

  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }

  mergeSort(A, n, 0, n);

  for(i=0;i<n;i++){
    if(i>0) printf(" ");
    printf("%d",A[i]);
  }

  printf("\n");
  printf("%d\n",count);
  
  return 0;
}

void merge(int A[],int n,int left,int mid,int right){
  int n1, n2,i,j,k;
  
  n1 = mid - left;
  n2 = right - mid;
  
  for(i=0;i<n1;i++){
    L[i] = A[left + 1];
  }

  for(i=0;i<n2;i++){
    R[i] = A[mid + 1];
  }

  L[n1] =  R[n2] = SENTINEL;
  
  int i = 0;
  int j = 0;

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

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

