#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
FILE*fin=fopen("algsort.in","r");
FILE*fout=fopen("algsort.out","w");
int i,j,k,m,l,n,w[500005],a,aux;
vector <int> v;
int main()
{
    fscanf(fin,"%d",&n);
    for(i=1;i<=n;i++)
    fscanf(fin,"%d",&w[i]);

    for (i=1;i<n;i++)
    for (j=i+1;j<=n;j++)
    if (w[i]>w[j])
    {
        w[i]^=w[j];
        w[j]^=w[i];
        w[i]^=w[j];
    }

    for(i=1;i<=n;i++)
    fprintf(fout,"%d ",w[i]);
    fprintf(fout,"\n");
    fprintf(fout,"\n");

    return 0;
}