#include <iostream>
#include <fstream>
#include <array>
#include <time.h>

using namespace std;

const int N = 500001;
int v[N];

/*ifstream f("input.txt");
ofstream g("output.txt");*/

ifstream f("algsort.in");
ofstream g("algsort.out");

void quickSort(int s, int d)
{
    if(s < d)
	{
        srand(time(NULL));

		int m = rand() % (d - s + 1) + s;
		int aux = v[s];
		v[s] = v[m];
		v[m] = aux;
		int i = s , j = d, d = 0;
		while(i < j)
		{
			if(v[i] > v[j])
			{
				aux = v[i]; 
				v[i] = v[j];
				v[j] = aux;
				d = 1 - d;
			}
			i += d;
			j -= 1 - d;
		}
		quickSort(s , i - 1);
		quickSort(i + 1 , d);
	}

}

int main()
{
    int n;
    f >> n;
    for (int i = 0; i < n; ++i)
        f >> v[i];
    quickSort(0, n - 1);
    for (int i = 0; i < n; ++i)
        g << v[i] << " ";
}