#include <fstream>
using namespace std;

ifstream cin("algsort.in");
ofstream cout("algsort.out");

void swap(int& a, int& b)
{
    int aux = a;
    a = b;
    b = aux;
}

void quickSort(int a[], int st, int dr)
{
    if(st < dr)
    {
        int poz = st;
        for(int i = st; i < dr; ++i)
            if(a[i] < a[dr])
                swap(a[poz++], a[i]);
        swap(a[poz], a[dr]);
        quickSort(a, st, poz - 1);
        quickSort(a, poz + 1, dr);
    }
}

void QuickSort(int v[], int st, int dr)
{
	if(st < dr)
	{
		//pivotul este inițial v[st]
		int m = (st + dr) / 2;
		int aux = v[st];
		v[st] = v[m];
		v[m] = aux;
		int i = st , j = dr, 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(v, st , i - 1);
		QuickSort(v, i + 1 , dr);
	}
}

int n, a[500001];

int main()
{
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    quickSort(a, 1, n);
    for(int i = 1; i <= n; ++i)
        cout << a[i] << " ";

    return 0;
}