#include<stdio.h>
#include<stdlib.h>
void insertion_sort(int arr[], int n){
    int i, key, j;
    for(i = 1; i < n; i++){
        key = arr[i];
        j = i - 1;
        while(j >= 0 && arr[j] > key){
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}
int main(){
    int n, purity;
    if(scanf("%d", &n) != 1){
        printf("Invalid input\n");
        return 0;
    }
    if(n <= 0 || n > 100){
        printf("Invalid input\n");
        return 0;
    }
    int *purity_levels = (int *)malloc(n * sizeof(int));
    if(purity_levels == NULL){
        printf("Invalid input\n");
        return 0;
    }
    for(int i = 0; i < n; i++){
        if(scanf("%d", &purity) != 1){
            printf("Invalid input\n");
            free(purity_levels);
            return 0;
        }
        if(purity < 1 || purity > 100000){
            printf("Invalid input\n");
            free(purity_levels);
            return 0;
        }
        purity_levels[i] = purity;
    }
    insertion_sort(purity_levels, n);
    for(int i = 0; i < n; i++){
        printf("%d", purity_levels[i]);
        if(i < n - 1);
        printf(" ");
    }
}
printf("\n");
free(purity_levels);
return 0;
}