#include <stdio.h>

#define max 500000
#define sentinel 200000000000

int L[max/2 + 2];
int R[max/2 + 2];
int count;



int merge(int A[], int n, int left, int mid, int right)  {
  int i, j, k, n1, n2;
  n1 = mid - left;
  n2 = right - mid;
  
  for (i = 0; i < n1; i++)
    L[i] = A[left+i];
  for (i = 0; i < n2; i++)
    R[i] = A[mid+i];
  
  L[n1] = R[n2] = sentinel;
  
  i = j = 0;
  for ( k = left; k < right; k++)  {
    count++;
  if ( L[i] <= R[j])  
    A[k] = L[i++];
  else 
    A[k] = R[j++];
}

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

int main(void)  {
  int A[max], n, i;
  count = 0;
  
  scanf("%d", &n);
  for (i = 0; i < n; i++) 
    scanf("%d", &A[i]);
  
  mergeSort(A, n, 0, n);

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

}
 
  
  