#include<iostream>
#include<fstream>
using namespace std;

void insertion(int a[], int n);

int main(){

    ifstream fin("algsort.in");
    ofstream fout("algsort.out");

    int a[500000],i,n;

    fin>>n;
    for(i=0;i<n;i++){
        fin>>a[i];
    }
    insertion(a,n);

    for(i=0;i<n;i++){
        fout<<a[i]<<" ";
    }
}

void insertion(int a[], int n){

    int i,j,aux;

    for(i=0;i<n-1;i++){
        j=i;
        while(j>=0 && a[j] > a[j+1]){
            aux=a[j];
            a[j]=a[j+1];
            a[j+1]=aux;
        }
    }

}