#include <bits/stdc++.h>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

int v[500001];
int temp[500001];
int n;

void Mergesort(int v[],int st,int dr)
{
    if(st<dr)
    {
        int m = (st+dr)/2;
        Mergesort(v,st,m);
        Mergesort(v,m+1,dr);
        int i = st,j = m+1, p = 0;
        while(i<=m && j<=dr)
        {
            if(v[i]<v[j])
            {
                temp[++p] =v[i++];
            }
            else{
                temp[++p] = v[j++];
            }
        }
        while(i<=m)
        {
            temp[++p] =v[i++];
        }
        while(j<=dr)
        {
            temp[++p] = v[j++];
        }
        for(int i = st, j = 1;i<=dr;i++,j++)
            v[i] = temp[j];
    }
}

void Quicksort(int v[],int st,int dr)
{
    if(st<dr)
    {
        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 main()
{
    fin>>n;
    for(int i = 1;i<=n;i++)
    {
        fin>>v[i];
    }
    Quicksort(v,1,n);
    for(int i = 1;i<=n;i++)
    {
        fout<<v[i]<<' ';
    }
    return 0;
}