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

#define INFTY 1000000000

int count=0;

void merge(int A[],int left,int mid,int right){
  int n1,n2,i,j,k;
  int *L,*R;

  n1 = mid - left;
  n2 = right - mid;
  /*L[0...n1], R[0...n2] を生成*/
  L=(int *)malloc(sizeof(int)*(n1+1));
  R=(int *)malloc(sizeof(int)*(n2+1));
  for( i = 0; i<=n1-1; i++){
    L[i] = A[left + i];
  }

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

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

      else{
        A[k] = R[j];
        j = j + 1;
        count++;
      }
    }

    free(L);
    free(R);
  }

void mergeSort(int A[],int left,int right){
        int i,mid;

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

 int main(){

   int A[5000000];
   int n,i;

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

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

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

