#include <stdio.h>

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

    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]);
    }
    return 0;
}