#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

int main()
{
	int n, x;
	fin >> n;

	priority_queue<int> heap;

	for (int i = 0; i < n; i++)
	{
		fin >> x;
		heap.push(-x);
	}

	for (int i = 0; i < n; i++)
	{
		fout << -heap.top() << ' ';
		heap.pop();
	}
}

/*

	

*/