//count sort
#include<fstream>
#define dim  500008


using namespace std;


ifstream f("algsort.in");
ofstream g("algsort.out");
int a[dim],Pos[dim],Fr[dim],n,i;
void countSort () {
    int i;
    for(i=1;i<=n;++i){
        Fr[a[i]]++;
    }
    for(i=1;i<=dim;++i){
        Fr[i]+=Fr[i-1];
    }

    for(i=1;i<=n;++i){
        Pos[Fr[a[i]]]=a[i];
        Fr[a[i]]--;
    }
    for(i=1;i<=n;++i){
        g<<Pos[i]<<" ";
    }
}
int main (){

    f>>n;

    for(i=1;i<=n;++i){
        f>>a[i];
    }

    countSort();
    return 0;
}