#include <iostream>
#include <fstream>

using namespace std;

ifstream in("sortare.in");
ofstream out("sortare.out");
int n,v[100];

int poz(int v[100], int s, int d)
{
    int x=v[s];
    while(s<d)
    {
        while(s<d && x<=v[d])
            d--;
        v[s]=v[d];
        while(s<d && x>=v[s])
            s++;
        v[d]=v[s];
    }
    v[s]=x;
    return s;
}

void QuickSort(int v[100], int s, int d)
{
    int p;
    p=poz(v,s,d);
    if(s<p-1)
        QuickSort(v,s,p-1);
    if(d>p+1)
        QuickSort(v,p+1,d);
}

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