#include <fstream>
using namespace std;

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

int n, a[500001];

void swap(int& a, int& b)
{
    int aux = a;
    a = b;
    b = aux;
}

void quickSort(int a[], int st, int dr)
{
    if(st < dr)
    {
        int poz = st;
        for(int i = st; i < dr; ++i)
            if(a[i] < a[dr])
                swap(a[poz++], a[i]);
        swap(a[poz], a[dr]);
        quickSort(a, st, poz - 1);
        quickSort(a, poz + 1, dr);
    }
}

int main()
{
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    quickSort(a, 1, n);
    for(int i = 1; i <= n; ++i)
        cout << a[i] << " ";

    return 0;
}