#include <fstream>
#include <algorithm>
#include <ctime>


int v[1<<19];
int n;


void quicksort(int l, int r)
{

	int i=l, j=r, pivot = v[(std::rand()%(r-l+1)) + l];
	do 
	{
		while (v[i] < pivot && i <= r)
			++i;
		while (v[j] > pivot && j >= l)
			--j;
		if (i <= j)
		{
			std::swap(v[i], v[j]);
			++i; --j;
		}
	}while(i <= j);


	if (i < r)
		quicksort(i, r);
	if (l < j)
		quicksort(l, j);

}



int main()
{

	std::srand(std::time(0)); 
	std::ifstream fin("algsort.in");
	std::ofstream fout("algsort.out");

	fin>>n;
	for (int i = 0; i < n; ++i)
		fin>>v[i];
	quicksort(0, n-1);
	for (int i = 0; i < n; ++i)
		fout<<v[i]<<" ";

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

}