#include<stdio.h>

int sum =0;


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

void merge(int A[],int left,int mid,int right){
  int n1,n2;
  int L[500000],R[500000];
  int i,j,k,cnt;

  n1 = mid - left;
  n2 = right - mid;

  //  L[0...n1], R[0...n2] �𐶐�                                                                                   
  for( i = 0;i<= n1;i++){
    L[i] = A[left + i];
  }
  for (i = 0;i<= n2-1;i++){
    R[i] = A[mid + i];
  }
  L[n1] = 1000000000;
  R[n2] = 1000000000;
  i = 0;
  j = 0;
  for( k = left; k<= right-1;k++){
    sum++;
    if (L[i] <= R[j]){
      A[k] = L[i];
      i = i + 1;
    } else{
      A[k] = R[j];
      j = j + 1;
    }
  }
}

int main(){
  int n,s_prog[500000];
  int i;

  scanf("%d",n);
   for(i=0;i<n;i++){
    scanf("%d",s_prog);
  }

  mergeSort(s_prog,0,n);

  for(i=0;i<n;i++){
    if(i <= n-2){
      printf("%d",s_prog[i]);
    }
    else if(i == n-1){
      printf("%d\n",s_prog[i]);
    }
  }
  printf("%d\n",sum);

  return 0;

}
