#include <fstream>

using namespace std;

int v[500005];

void swap(int &x, int &y)
{
    int aux = x;
    x = y;
    y = aux;
}

void sort(int l, int r)
{
    int i = l, j = r;
    int p = v[(l+r)/2];
    while(i <= j){
        while(i < r && v[i] < p)
            ++i;
        while(j > l && v[j] > p)
            --j;
        if(i <= j){
            swap(v[i], v[j]);
            ++i;
            --j;
        }
    }
    if (l < j)
        sort(l, j);
    if (i < r)
        sort(i, r);
}

int main()
{
    ifstream fin ("algsort.in");
    ofstream fout ("algsort.out");
    int n;
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
    sort(1, n);
    for (int i = 1; i <= n; ++i)
        fout << v[i] << " ";
    fin.close();
    fout.close();
    return 0;
}