#include<stdio.h>
#include<algorithm>
using namespace std;
/*void quicksort(int st, int dr, long long v[500001])
{
    int i,j;i=st;j=dr;
    long long pivot=v[(i+j)/2],aux;
    while(i<=j)
    {
        while(v[i]<pivot) ++i;
        while(v[j]>pivot) ++j;
        if(i<=j)
        {
            aux=v[i];v[i]=v[j];v[j]=aux;++i;--j;
        }
    }
    if(i<dr) quicksort(i,dr,v);
    if(j>st) quicksort(st,j,v);
}*/
int i,n;long long a[500001];
int main()
{
    freopen("algsort.in","r",stdin);
    scanf("%d",&n);
    for(i=1;i<=n;++i)
        scanf("%lld",&a[i]);
        sort(a+1,a+n+1);
    //quicksort(1,n,a);
    fclose(stdin);
    freopen("algsort.out","w",stdout);
    for(i=1;i<=n;++i)
    printf("%lld ",a[i]);
    fclose(stdout);
    return 0;
}