#include<stdio.h>
#include<stdlib.h>
#define INFTY 1000000001
int count = 0;

void merge(int *A,int left,int mid,int right){
    int n1 = mid - left;
    int n2 = right - mid;
    int *L;
    int *R;
    L = (int *)malloc(n1+1);
    R = (int *)malloc(n2+1);
    int i,j,k;
    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++){
        if(L[i]<=R[j]){
            A[k] = L[i];
            i++;
        }else{
            A[k] = R[j];
            j++;
        }
        count++;
    }
    
    
}


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);
    }
}

int main(){
    int A[100];
    int i,N;
    scanf("%d",&N);
    for(i=0;i<N;i++){
        scanf("%d",&A[i]);
    }
    mergeSort(A,0,N);
    for(i=0;i<N;i++){
        if(i==0){
            printf("%d",A[i]);
        }else{
            printf(" %d",A[i]);
        }
    }
    printf("\n%d\n",count);
    return 0;
}