#include<stdio.h>

#define N 500000
#define SENTINEL 100000000
int A[N];
int left, mid, right;
int count = 0;

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



  for(i = 0; i < n1; i++) L[i] = A[left + i];
  for(i = 0; i < n2; i++) R[i] = A[mid + i];

  L[n1] = SENTINEL;
  R[n2] = SENTINEL;

  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){
  if(left + 1 < right){
    mid = (left + right) / 2;
    mergeSort(A, left, mid);
    mergeSort(A, mid, right);
    merge(A, left, mid, right);
  }
}

int main(){
  int i, n;

  scanf("%d", &n);

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

  left = 0;
  right = n;
  mergeSort(A, left, right);

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

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