#include<algorithm>
using namespace std;
long long unsigned a[500001];
int n;
/*void sort(int n)
{
     int i,k,aux;
     for(i=1;i<n;i++)
     for(k=i+1;k<=n;k++)
     {
                        if(a[i]>a[k])
                        {
                        aux=a[i];
                        a[i]=a[k];
                        a[k]=aux;
                        }
}}*/
int main ()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    int n,i,k;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    scanf("%lld",&a[i]);
    sort (a+1,a+1+n);
    for(i=1;i<=n;i++)
    printf("%lld ",a[i]);
    return 0;
}