#include <iostream>
#include <vector>

using namespace std;

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

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

	if (left <= backupMiddle)
	{
		sortedArray.push_back(array[left]);
		left++;
	}
	else
	{
		sortedArray.push_back(array[middle]);
		middle++;
	}

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

void mergesort(std::vector<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);
}

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

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

	return sortedArray;
}

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

	int n; cin >> n;
	vector<int> array;
	for(int i = 0; i < n; i++)
	{
		int x; cin >> x;
		array.push_back(x);
	}

	vector<int> sorted = Sort(array);
	for(int i = 0; i < sorted.size(); i++)
	{
		cout << sorted[i] << ' ';
	}	

	return 0;
}