#include<fstream>
#include<iostream>
#include<cstdlib>
#include<algorithm>
using namespace std;
ifstream fin ("algsort.in");
ofstream fout("algsort.out");
int n,i,a[10000009];
int cmp( const void *A, const void *B)
{
    int x,y;
    x=*(int*)A;
    y=*(int*)B;
    if(x<y)
    {
        return -1;
    }
    if(x>y)
    {
        return 1;
    }
    return 0;
}
int main ()
{
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>a[i];
    }
    sort(a+1,a+n+1);
    //qsort(a+1,n,sizeof(int),cmp);
    for(i=1;i<=n;i++)
    {
        fout<<a[i]<<" ";
    }
    fin.close();
    fout.close();
    return 0;
}