#include<stdio.h>

int i, j, count, L[500000], R[500000], N = 500000, M = 100000000;

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

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

int main(){
  int A[N], n;
  
  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;
}