using namespace std;
#include<cstdio>
#include<queue>
#include<vector>
typedef unsigned int nat;
int main()
{
	int n;
	nat x;
	priority_queue<nat,vector<nat>,greater<nat> >heap;
	FILE *f=fopen("algsort.in","r");
	FILE *g=fopen("algsort.out","w");
	fscanf(f,"%d",&n);
	for(int i=1;i<=n;i++)
	{
		fscanf(f,"%u",&x);
		heap.push(x);
	}
	while(!heap.empty())
		fprintf(g,"%u ",heap.top()),heap.pop();
	fclose(f);
	fclose(g);
	return 0;
}