#include <iostream>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
const int maxn = 500005;
int v[maxn];

void quicksort(int st, int dr)
{
    if(st == dr)
        return;
    int pivot = v[(st + dr) / 2];
    int i = st;
    int j = dr;
    while(i <= j)
    {
        while(v[i] < pivot)
            i++;
        while(v[j] > pivot)
            j--;
        if(i <= j)
        {
            swap(v[i], v[j]);
            i++;
            j--;
        }
    }
    quicksort(st, j);
    quicksort(i, dr);
}

int main()
{
    int n;
    in >> n;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    quicksort(1, n);
    for(int i = 1; i <= n; i++)
        out << v[i] << " ";
    out << "\n";
    return 0;
}