//Include
#include <fstream>
#include <queue>
using namespace std;

//Variabile
ifstream in("algsort.in");
ofstream out("algsort.out");

int elements;
int element;

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

//Main
int main()
{
	in >> elements;
	while(elements--)
		in >> element, heap.push(element);
	
	while(!heap.empty())
		out << heap.top() << ' ', heap.pop();
	
	in.close();
	out.close();
	return 0;
}