#include <stdio.h>
#define N 500000
#define INFTY 1000000000
int L[N],R[N];
int count=0,n;
void merge(int * ,int ,int ,int );
void mergeSort(int *,int ,int );
int main()
{
  int A[N],i;

  
  scanf("%d",&n);

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

  mergeSort(A,0,n);
  for(i=0;i<n;i++)
    {
      printf("%d",A[i]);
      if(i!=n-1)printf(" ");


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




  
return 0;
}


void  merge(int A[],int left,int mid,int right)
{
  int  n1 = mid - left,n2=right - mid,i=0,j=0,k=0;
 
  for( i = 0;i<n1;i++)   L[i] = A[left + i];
  for (i = 0;i<n2;i++)   R[i] = A[mid + i];
  
  L[n1] = INFTY;
  R[n2] = INFTY;
  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)
    {
      int  mid = (left + right)/2;
      mergeSort(A, left, mid);
      mergeSort(A, mid, right);
      merge(A, left, mid, right);
    }
}

