#include<stdio.h>
#include<stdlib.h>

void merge (int arr[], int l, int m, int r) {
    int n1 = m - l + 1;
    int n2 = r - m;
    int L[n1], R[n2];
    for (int i = 0; i < n1; i++) L[i] = arr[l  +i];
    for (int j = 0; j < n2; j++) R[j] = arr[m + j];
    int i = 0, j = 0, k = 1;
    while (i < n1 && j < n2) {
        if(L[i] >= R[j]) arr[k++] = L[i++];
        else arr[k++] = R[j++];
    }
    while(i < n1) arr[k++] = L[i++];
    while(j < n2) arr[k++] = R[j++];
}
void mergeSort(int arr[], int l, int r) {
    if(l < r) {
        int m = l +(r - l) / 2;
        mergeSort(arr, l , m);
        mergeSort(arr, m + 1, r);
        merge(arr, l, m, r);
    }
}
int main () {
    int n;
    scanf("%d", &n);
    if (n<= 0){
        printf("Invalid input\n");
        return 0;
    }
    int* grades = (int*)malloc(n * sizeof(int));
    for(int i = 0; i < n;i++) scanf("%d", &grades[i]);
    mergeSort(grades, 0, n - 1);
    for (int i = 0; i < n; i++) printf("%d ", grades[i]);
    freegr