#include <fstream>
#include <ctime>
#include <cstdlib>

using namespace std;

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

int sir[500005], N;

void Random_Pivot(int L, int R)
{
    int P = L + rand() % (R - L);
    swap(sir[L], sir[P]);
}

int Divide_Lomuto(int L, int R)
{
    //Random_Pivot(L, R);
    int st = L, dr = R, x = sir[L];
    while(st < dr)
    {
        while(st < dr && sir[dr] >= x) dr--;
        sir[st] = sir[dr];
        while(st < dr && sir[st] <= x) st++;
        sir[dr] = sir[st];
    }
    sir[st] = x;
    return st;
}

int Divide_Hoare(int L, int R)
{
    Random_Pivot(L, R);
    int st = L - 1, dr = R + 1;
    int pivot = sir[L];
    while(true)
    {
        do
        {
            st++;
        }while(sir[st] < pivot);
        do
        {
            dr--;
        }while(sir[dr] > pivot);

        if(st >= dr) return dr;
        swap(sir[st], sir[dr]);
    }
}

void QuickSort(int L, int R)
{
    int M = Divide_Hoare(L, R);
    if(M - L > 1) QuickSort(L, M - 1);
    if(R - M > 1) QuickSort(M + 1, R);
}

int main()
{
    srand(time(NULL));
    cin >> N;
    for(int i = 1; i <= N; i++)
        cin >> sir[i];
    QuickSort(1, N);
    for(int i = 1; i <= N; i++)
        cout << sir[i] << " ";
    return 0;
}