// Include
#include <fstream>
#include <algorithm>
using namespace std;

// Constante
const int sz = 500001;

// Functii
void quickSort(int left, int right);

// Variabile
ifstream in("algsort.in");
ofstream out("algsort.out");

int num;
int values[sz];

// Main
int main()
{
	in >> num;
	for(int i=1 ; i<=num ; ++i)
		in >> values[i];
	
	quickSort(1, num);
	
	for(int i=1 ; i<=num ; ++i)
		out << values[i] << ' ';
	out << '\n';
	
	in.close();
	out.close();
	return 0;
}

void quickSort(int left, int right)
{
	int currentLeft = left;
	int currentRight = right;
	int mid = (left+right) / 2;
	
	while(currentLeft <= currentRight)
	{
		while(values[currentLeft] < values[mid])
			++currentLeft;
		while(values[mid] < values[currentRight])
			--currentRight;
		
		swap(values[currentLeft++], values[currentRight--]);
	}
	
	if(left < currentRight)
		quickSort(left, currentRight);
	if(currentLeft < right)
		quickSort(currentLeft, right);
}