#include<stdio.h>
#define INFTY 2000000000

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

int count=0;

int main(){
  int i;
  int n;
  int S[1000000];

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

  mergeSort(S,0,n);

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

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

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

  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){
  int mid;

  if(left+1<right){
    mid=(left+right)/2;
    mergeSort(A,left,mid);
    mergeSort(A,mid,right);
    merge(A,left,mid,right);
  }
}