#include<cstdio>
#include<algorithm>
using namespace std;
int i,n,a[500010];
void read(),solve();
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",&a[i]);
}
void solve()
{
	sort(a+1,a+n+1);
	for(i=1;i<=n;i++)printf("%d ",a[i]);
}