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