#include <fstream>
#include <iostream>
#include <time.h>
#include <random>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

const int Nmax = 500005;
void quickSort( int v[], int st, int dr )
{

    if ( st >= dr )
        return ;
    int pos = st + rand() % (dr - st + 1);
    int pivot = v[pos], leftPointer = st, rightPointer = dr;

    while ( true )
    {
        while ( leftPointer <= dr && v[leftPointer] < pivot )
            ++leftPointer;
        while ( st <= rightPointer && v[rightPointer] > pivot )
            --rightPointer;

        if ( leftPointer < rightPointer )
            swap(v[leftPointer++], v[rightPointer--]);
        else
            break;
    }
    quickSort(v, st, pos - 1);
    quickSort(v, pos + 1, dr);
}
int main()
{
    int v[Nmax];
    srand(time(0));
    int n, i;
    fin >> n;
    for ( i = 1; i <= n; ++i )
        fin >> v[i];

    quickSort(v, 1, n);
    for ( i = 1; i <= n; ++i )
        fout << v[i] << " ";


    return 0;
}