#include <stdio.h>
#include <stdlib.h>
#include <math.h>

void merge(int *, int, int, int);
void mergeSort(int *, int, int);

int A[10000], count=0, left, mid, right;

int main(){
  int i, j, n;

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

  mergeSort(A, 0, n);

  for(j=0; j<n; j++){
    if(j<n-1) printf("%d",A[j]);
    else if(j==n) printf("%d\n",A[j]);
  }
  printf("%d\n",count);

  return 0;
}

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

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

