#include<stdio.h>
#define N 500000
#define M 2000000000
void merge(int *,int,int,int);
void mergesort(int *,int,int);
int L[(N/2)+2],R[(N/2)+2];
int cnt;

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

  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }
  mergesort(A,0,n);
  for(i=0;i<n-1;i++){
    printf("%d ",A[i]);
  }
  printf("%d\n%d\n",A[n-1],cnt);
  return 0;
}

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