//Include
#include <stdio.h>
#include <queue>
using namespace std;

//Variabile
FILE *in, *out;

int n;
int citit;

priority_queue<int, vector<int>, greater<int> > q;

//Main
int main()
{
	in = fopen("algsort.in","rt");
	out = fopen("algsort.out","wt");
	fscanf(in, "%d", &n);
	for(int i=1 ; i<=n ; ++i)
	{
		fscanf(in, "%d", &citit);
		q.push(citit);
	}
	
	while(!q.empty())
	{
		fprintf(out, "%d ", q.top());
		q.pop();
	}
	
	fclose(in);
	fclose(out);
	return 0;
}