#include<stdio.h>
#include<algorithm>
using namespace std;
int v[1000010],N,S,max=1,l[200100];
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&N);
for(int i=1;i<=N;++i)
{
scanf("%d",&v[i]);
}
                                                                                                             sort(v+1,v+1+N);
for(int i=1;i<=N;++i)
printf("%d ",v[i]);
return 0;
}