#include <stdio.h>
#include <math.h>
#define INFINITY 1000000001
int count=0;

void merge(int* A,int left,int mid,int right);
void mergeSort(int* A,int left,int right);


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

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

void merge(int* A,int left,int mid,int right){
  int n1,n2,L[300000],R[300000],i,j,k;
  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] = INFINITY;
  R[n2] = INFINITY;

  i = 0;
  j = 0;

  for(k = left; k <= right-1; 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){
int mid;
if(left + 1 < right){
mid = (left + right) / 2;

mergeSort(A,left,mid);

mergeSort(A,mid,right);

merge(A,left,mid,right);

}
}