// InsertionSort
 
#include <stdio.h>
#include <stdlib.h>
 
void printA(int a[], int n){
    int i;
    for(i=0;i<n;i++){
        printf("%d ",a[i]);
    }
    printf("\n");
}
 
void swap(int* a, int* b){
    int  tmp;
    tmp = *a;
    *a = *b;
    *b = tmp;
}
 
void InsertionSort(int a[], int n){
	//ここを書く
	void InsertionSort(int a[], int n){

    int i;
    
    for(i = 1; i < n; i++){

        int tmp = a[i];
        int j = i - 1;

        while(j >= 0 && a[j] > tmp){
            a[j + 1] = a[j];
            j--;
        }

        a[j + 1] = tmp;
    }
}
}
 
int main(void){
    int n,i;
    int *v;
    scanf("%d",&n);
    v = (int*)malloc(sizeof(int)*n);
    if(v==NULL){
        printf("ERROR\n");
        return -1;
    }
    for(i=0;i<n;i++){
        scanf("%d",&v[i]);
    }
    InsertionSort(v,n);
    printA(v,n);
    free(v);
    return 0;
}