#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>


using namespace std;
//ifstream fin("fisier.in");
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int n;
vector<int> v;

int cmp(const void *a, const void *b)
{
    return ( *(int*)a - *(int*)b);
}
void citire()
{

    for(int i=0;i<n;++i)
    {
        int a;
        fin>>a;
        v.push_back(a);
    }


}
void afisare()
{
    for(int i=0; i<n; ++i)
    {
        fout<<v[i]<<" ";
    }
    fout<<"\n";
}

void sortare()
{
    int schimbat;
    do
    {
        schimbat=0;
        for(int i=0; i<n-1; ++i)
            if(v[i]>v[i+1])
        {
            v[i]+=v[i+1];
            v[i+1]=v[i]-v[i+1];
            v[i]=v[i]-v[i+1];
            schimbat=1;
        }
    }while(schimbat);
}


int main()
{
    fin>>n;
    citire();
    //sortare();
    sort(v.begin(),v.end());

    afisare();

}