#include<stdio.h>

void insertionSort(int arr[], int n) {
    int j,i,key;
    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, i;
    
    if(scanf("%d, &n") != 1 || n <= 0) {
        printf("Invalid input");
        return 0;
    }
     
    int arr[n];
    for(i=0;i<n;i++) {
        if(scanf("%d", &arr[i]) != 1) {
            printf("Invalid input");
            return 0;
        }
    }
    insertionSort(arr, n);
    
    for(i=0;i<n;i++) {
        printf("%d", arr[i]);
        if(i<n-1)printf(" ");
    }
    return 0;
}