#include <cstdio>
#include <algorithm>
FILE *g,*z;
using namespace std;
int v[500001];
void qsort(int l,int r)
{
    int i=l,j=r,t=v[(r+l)/2];
    while(i<=j)
    {
        while(v[i]<t)
        i++;
        while(v[j]>t)
        j--;
        if(i<=j)
        {
            swap(v[i],v[j]);
            i++;
            j--;
        }
    }
    if(l<j)
    qsort(l,j);
    if(i<r)
    qsort(i,r);
}
int main()
{
    int n,i;
    g=fopen("algsort.in","r");
    fscanf(g,"%d",&n);
    for(i=1;i<=n;i++)
    fscanf(g,"%d",&v[i]);
    fclose(g);
    qsort(1,n);
    z=fopen("algsort.out","w");
    for(i=1;i<=n;i++)
    fprintf(z,"%d ",v[i]);
    fclose(z);
    return 0;
}