#include<stdio.h>
#include<stdlib.h>
#define SENTINEL 10000000000
void merge(int*, int, int, int);
void mergeSort(int*, int, int);

int count = 0;

int main() {
  int *A;
  int n,i,j;
  scanf("%d",&n);
  A = (int*)malloc(sizeof(int) * (n+1));

  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("%d\n",A[n-1]);
  printf("%d\n",count);
  free(A);
  return 0;
}

void merge(int *A, int left, int mid, int right) {
  int i,j,k;
  int n1,n2;
  int *L,*R;
  n1 = mid - left;
  n2 = right - mid;
  L = (int*)malloc(sizeof(int) * (n1+1));
  R = (int*)malloc(sizeof(int) * (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;
    }
  }
  free(R);
  free(L);
}

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);
  }
}