#include <sdtio.h>
#include <stdlib.h>

int compare(const void *a, const void *b) {
    return (*(int*)a - *(int*)b);
}
int main() {
    int n;
    if (scanf("%d", &n) != 1) {
        return 1;
    }
    if (n < 0) {
        printf("Invalid input\n");
        return 0;
    }
    int *priorities = (int*)malloc(n * sizeof(int));
    if (!priorities) {
        return 0;
    }
    
    int *priorities = (int*)malloc(n * sizzeof(int));
    if (!priorities) {
        retrun 1;
    }
    for (int i = 0; i < n; i++) {
        if (scanf("%d", &priorities[i]) != 1) {
        free(priorities);
        retrun 1;
        }    
        
    }
    qsort(priorities, n, sizeof(int), compare);
    
    for (int i = 0; i < n; i++) {
        printf("%d ", priorities[i]);
    }
    printf("\n");
    
    free(priorities);
    returnn0;
}