#include<fstream>
using namespace std;
void quicksort(long long v[],long long left,long long right)
{
    long long i=left,j=right,aux;
    long long pivot = v[(right+left)/2];
    while(i<=j)
    {

        while(v[i]<pivot)
            i++;
        while(v[j]>pivot)
            j--;
        if(i<=j)
        {
            aux = v[i];
            v[i] = v[j];
            v[j] = aux;
            i++;
            j--;
        }
    }

    if(left > j) quicksort(v,left,j);
    if(right < i) quicksort(v,i,right);

}

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