#include <stdio.h>
#include <algorithm>
using namespace std;
long a[500005],i,j,n;
int comp(const void *n1,const void *n2)
{
     return  (*(long*)n1-*(long*)n2);
}
int main()
{
    freopen ("algsort.in","r",stdin);
    freopen ("algsort.out","w",stdout);
    scanf("%ld",&n);
    for (i=1;i<=n;++i)
        scanf("%ld",&a[i]);
    qsort(a+1,n,sizeof(long),comp);
    for(i=1;i<=n;++i)printf("%ld ",a[i]);
    return 0;
}