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

using std::vector;
using std::cin;
using std::cout;
using std::swap;
using std::ofstream;
using std::ifstream;

int partition(int nums[], int left, int right)
{
	int r = rand() % (right - left + 1);
	swap(nums[r + left], nums[right]);

	int pivot = nums[right];
	int i = left - 1;

	for (int j = left; j <= right - 1; ++j) {
		if (nums[j] < pivot)
			swap(nums[++i], nums[j]);
	}

	swap(nums[++i], nums[right]);

	return i;
}

void quicksort(int nums[], int left, int right)
{
	if (left > right)
		return;

	int q = partition(nums, left, right);
	quicksort(nums, left, q - 1);
	quicksort(nums, q + 1, right);
}

int main()
{
	ifstream fin("algsort.in");
	ofstream fout("algsort.out");
	int n;
	int nums[500000];

	srand(time(NULL));

	fin >> n;
	for (int i = 0; i < n; ++i) {
		fin >> nums[i];
	}

	quicksort(nums, 0, n - 1);

	for (int i = 0; i < n; ++i) {
		fout << nums[i] << " ";
	}
	fout.flush();

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