#include <fstream>
using namespace std;

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

int v[500001], n;

void quicksort(int l, int r)
{
	if(l < r)
	{
		/* finding the pivot element and partitionig around it */
		int i, j, aux;
		for(i = l-1, j = l; j <= r-1; j++)
			if(v[j] <= v[r])
			{
				aux = v[++i];
				v[i] = v[j];
				v[j] = aux;
			}
		aux = v[++i];
		v[i] = v[r];
		v[r] = aux;
		/* finished partitioning */

		quicksort(l, i-1);
		quicksort(i+1, r);
    	
	}
}

int main()
{
    int i;

	fin >> n;
	for(i = 1; i <= n; ++i)
		fin >> v[i];

	quicksort(1, n);

	for(i = 1; i <= n; ++i)
		fout << v[i] << ' ';
	fout << endl;

	fin.close();
	fout.close();
	return 0;
}