#include <stdio.h>
#include <limits.h>

int cmpCnt = 0;

void merge(int S[], int left, int mid, int right) {
    int n1 = mid - left;
    int n2 = right - mid;

    int L[n1], R[n2];
    for (int i = 0; i < n1; i++) L[i] = S[left + i];
    for (int i = 0; i < n2; i++) R[i] = S[mid + i];

    L[n1] = INT_MAX;
    R[n2] = INT_MAX;

    int i = 0, j = 0;

    for (int k = left; k < right - 1; k++) {
        cmpCnt++;
        if (L[i] <= R[j]) {
            S[k] = L[i];
            i++;
        } else {
            S[k] = R[j];
            j++;
        }
    }
}

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

int main() {
    int n;
    scanf("%d", &n);

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

    mergeSort(S, 0, n);

    for (int i = 0; i < n; i++) printf("%d ", S[i]);
    printf("\n%d\n", cmpCnt);

    return 0;
}

