#include <cstdio>
#include <vector>

using namespace std;

void merge(std::vector<unsigned int>& array, int left, int middle, int right)
{
	std::vector<int> sortedArray;
	sortedArray.reserve(array.size());
	int backupLeft = left;
	int backupMiddle = middle;
	int backupRight = right;

	middle++;
	int position = 0;
	while ((left <= backupMiddle) && (middle <= right))
	{
		if (array[left] < array[middle])
		{
			sortedArray[position++] = array[left];
			left++;
		}
		else
		{
			sortedArray[position++] = array[middle];
			middle++;
		}
	}

	while (left <= backupMiddle)
	{
		sortedArray[position++] = array[left];
		left++;
	}

	while (middle <= right)
	{
		sortedArray[position++] = array[middle];
		middle++;
	}

	left = backupLeft;
	for (unsigned int i = 0; i < sortedArray.size(); i++)
	{
		array[i + left] = sortedArray[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;
	for (int i = 0; i < n; i++)
	{
		unsigned int x; scanf("%d", &x);
		array.push_back(x);
	}

	Sort(array);

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

	return 0;
}