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

void mergeSort(int *,int,int);
int *S;
int *L;
int *R;
int *sortS;
int n;
int count=0;;
int main(){
  
  int q;
  int flug=0;
  int i,j;
  
  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]);
  }
    printf("\n%d",count);
}

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

