#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

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

int v[500001], tmp[500001];
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, k = 0;
        while( i <= m && j <= dr )
            if( v[i] < v[j])
                tmp[++k] = v[i++];
            else
                tmp[++k] = v[j++];
        while(i <= m)
            tmp[++k] = v[i++];
        while(j <= dr)
            tmp[++k] = v[j++];
        for(i = st, j = 1 ; i <= dr ; i ++, j ++)
            v[i] = tmp[j];
    }
}

void QuickSort(int v[], int st, int dr)
{
    if(st < dr)
    {
        int m = (st + dr) / 2;
        swap(v[st],v[m]);
        int i = st, j = dr, d = 0;
        while(i < j)
        {
            if(v[i] > v[j])
            {
                swap(v[i],v[j]);
                d = 1 - d;
            }
            i += d;
            j -= 1 - d;
        }
        QuickSort(v, st, i - 1);
        QuickSort(v, i + 1, dr);
    }
}
int main()
{

    int n,i;
    fin>>n;
    for(i=1; i<=n; i++)
        fin>>v[i];
    ///MergeSort(v,1,n);
    QuickSort(v,1,n);
    for(i=1; i<=n; i++)
        fout<<v[i]<<" ";
    return 0;
}