#include <stdio.h>

void merge(int[],int,int,int);
void Sort(int[],int,int);


int L[500000/4],R[500000/4],count = 0;

int main()
{
  int i,n,S[500000];
  scanf("%d",&n);
  for(i = 0;i < n;i++)
    {
      scanf("%d",S[i]);
    }
  Sort(S,0,n);
  for(i = 0;i < n;i++)
    {
      if(i >0) printf(" ");
      printf("%d",S[i]);
    }
  printf("\n%d\n",count);
  return 0;
}
void merge(int S[],int left,int mid,int right)
{
  int i,j,k,n1,n2;
  n1 = mid - left;
  n2 = right - mid;
  for(i = 0;i < n1;i++)
    {
      L[i] = S[left + i];
    }
  for(i = 0;i < n2;i++)
    {
      R[i] = S[mid + i];
    }
  L[n1] = R[n2] = 2000000000;
  i = 0;
  j = 0;
  for(k = left;k < right;k++)
    {
      count++;
      if(L[i] <= R[j])
	{
	  S[k] = L[i];
	  i = i + 1;
	} else
	{
	  S[k] = R[j];
	  j = j + 1;
	}
    }
}
void Sort(int S[],int left,int right)
{
  int mid;
  if(left + 1 < right)
    {
      mid = (left + right) / 2;
      Sort(S,left,mid);
      Sort(S,mid,right);
      merge(S,left,mid,right);
    }
}
	  

