#include <cstdio>
#include <vector>

using namespace std;

void merge(std::vector<unsigned int>& array, int left, int middle, int right)
{
	std::vector<unsigned int> sortedPieceOfArray;
	int i = left;
	int j = middle + 1;

	while ((i <= middle) && (j <= right))
	{
		if (array[i] < array[j])
		{
			sortedPieceOfArray.push_back(array[i++]);
		}
		else
		{
			sortedPieceOfArray.push_back(array[j++]);
		}
	}

	while (i <= middle)
	{
		sortedPieceOfArray.push_back(array[i++]);
	}

	while (j <= right)
	{
		sortedPieceOfArray.push_back(array[j++]);
	}

	for (int i = 0; i < sortedPieceOfArray.size(); i++)
	{
		array[i + left] = sortedPieceOfArray[i];
	}
}

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

	int middle = (left + right) / 2;
	mergesort(array, left, middle);
	mergesort(array, middle + 1, right);
	merge(array, left, middle, right);
}

void Sort(std::vector<unsigned int>& array)
{
	mergesort(array, 0, array.size() - 1);
}

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

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

	Sort(array);

	for (int i = 0; i < n; i++)
	{
		printf("%d ", array[i]);
	}

	return 0;
}