#include <cstdio>
#include <vector>

using namespace std;

int getPivot(std::vector<unsigned int> &array, int left, int right)
{
	int pivotIndex = left;
	int pivotValue = array[right];
	for (int i = left; i <= right - 1; i++)
	{
		if (array[i] < pivotValue)
		{
			std::swap(array[i], array[pivotIndex]);
			pivotIndex++;
		}
	}

	std::swap(array[pivotIndex], array[right]);

	return pivotIndex;
}

void quicksort(std::vector<unsigned int> &array, int left, int right)
{
	if (left >= right)
	{
		return;
	}

	int pivot = getPivot(array, left, right);
	quicksort(array, left, pivot - 1);
	quicksort(array, pivot + 1, right);
}

std::vector<unsigned int> Sort(std::vector<unsigned int> array)
{
	std::vector<unsigned int> sortedArray(array);

	quicksort(sortedArray, 0, sortedArray.size() - 1);

	return sortedArray;
}

int main()
{
	freopen("algsort.in", "r", stdin);
	freopen("algsort.out", "w", stdout);

	int n; scanf("%d", &n);
	vector<unsigned int> array;
	for (int i = 0; i < n; i++)
	{
		unsigned int x; scanf("%d", &x);
		array.push_back(x);
	}

	vector<unsigned int> sorted = Sort(array);
	for (int i = 0; i < sorted.size(); i++)
	{
		printf("%d ", sorted[i]);
	}

	return 0;
}