#include<fstream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
int n,x;
priority_queue<int, vector<int>,greater<int> >V;
int main()
{
	ifstream in("quicksort.in");
	ofstream out("quicksort.out");
	in>>n;
	for(int i=1;i<=n;i++)
	{
		in>>x;
		V.push(x);
	}
	for(int i=1;i<=n;i++)
	{
		out<<V.top()<<" ";
		V.pop();
	}
	
	
	
	return 0;
}