#include <bits/stdc++.h>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int n, v[500005], w[500005];

void mergesort(int st, int dr)
{
    if(st < dr)
    {
        int m = (st + dr) /2;
        mergesort(st, m);
        mergesort(m + 1, dr);
        int i = st, j = m + 1, k = 1;
        while (i <= m && j <= dr)
        {
            if(v[i] < v[j])
            {
                w[k++] = v[i];
                i++;
            }
            else
            {
                w[k++] = v[j];
                j++;
            }
        }
        while (i <= m)
        {
            w[k++] = v[i];
            i++;
        }
        while (j <= dr)
        {
            w[k++] = v[j];
            j++;
        }
        j = st;
        for(i = 1; i < k; i++)
        {
            v[j++] = w[i];
        }
    }
}


int part(int st, int dr)
{
    int pivot = v[dr];
    int j = st - 1;
    for (int i = st; i <= dr - 1; i++)
    {
        if(v[i] < pivot)
        {
            j++;
            swap(v[i], v[j]);
        }
    }
    swap(v[j + 1], v[dr]);
    return j + 1;
}

void quicksort(int st, int dr)
{
    if (st < dr)
    {
        int p = part(st, dr);
        quicksort(st, p - 1);
        quicksort(p + 1, dr);
    }
}


int main()
{
    f >> n;
    for(int i = 1; i <= n; i ++)
    {
        f >> v[i];
    }
    //mergesort(1, n);
    quicksort(1, n);
        for(int i = 1; i <= n; i ++)
            g << v[i] << " ";

    return 0;
}