#include<fstream>
using namespace std;

void quicksort(int v[],int left , int right)
{

    int i=left,j=right,aux;
    int pivot = v[(i+j)/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()
{

    ifstream in("algsort.in");
    ofstream out("algsort.out");
    int i,n,s,v[500001];
    in>>n;

    for(i = 1; i <= n ; i++)
    {

        in>>v[i];
    }
    quicksort(v,1,n);
    for(i = 1 ; i<=n ; i++)
        out<<v[i]<<" ";
    in.close();
    out.close();
    return 0;
}