#include <stdio.h>
#define MAX 500000
#define INFTY 2000000000

int L[MAX/2+2],R[MAX/2+2];
int cnt;

void merge(int A[MAX],int left,int mid,int right)
{
  int n1,n2,i,k,j;
  
  n1 = mid - left;
  n2 = right - mid;
  for(i = 0; i < n1 - 1; i++)
    {
      L[i] = A[left + i];
    }
  for(i = 0; i < n2 - 1; i++)
    {
      R[i] = A[mid + 1];
    }
  L[n1] = INFTY;
  R[n2] = INFTY;
  i = 0;
  j = 0;
  for(k = left; k < right - 1; k++)
    {
      cnt++;
      if(L[i] <= R[j])
	{
	  A[k] = L[i];
	  i++;
	}
      else{
	A[k] = R[j];
	j++;
      }
    }
  
};

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


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

  mergeSort(A,0,n + 1);

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

