#include<stdio.h>
int count = 0;
int L[500000];
int R[500000];

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] = 1000000000;
R[n2] = 1000000000;

i=0;
j=0;

for(k = left ; k < right ; k++){

if(L[i]<= R[j]){
A[k]=L[i];
i = i+1;
count++;
}
else{
    A[k]=R[j];
    j=j+1;
count++;
}

}
}


void MargeSort(int *A,int left ,int right){
    int mid;
if((left + 1) < right){
 mid = (left + right) / 2;
  MargeSort(A,left,right);
  MargeSort(A,mid,right);
  Merge(A,left,mid ,right);

}

}
int main(){

int n,i,left,right;
int S[500000];

scanf("%d",&n);

for(i = 0;i < n;i++){

    scanf("%d",&S[i]);
}
left = 0;
right = n;

MargeSort(S,left,right);


for(i = 0;i < n;i++){

printf("%d",S[i]);

if(i+1 != n)
printf("/n");
}
printf("%d",count);
return 0;
}
