#include<stdio.h>
int L[500000],R[500000];
int cnt;

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

void mergeSort(int A[],int n,int left,int right){
    int mid;
    if(left+1<right){
        mid=(left+right)/2;
        mergeSort(A,n,left,mid);
        mergeSort(A,n,mid,right);
        merge(A,n,left,mid,right);
    }
}

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