#include<stdio.h>
#include<algorithm>
using namespace std;
int n,i,j,a[500100];
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)scanf("%d",&a[i]);
    for(i=n;i>=2;i--)
        for(j=i-1;j>=1;j--)
            if(a[i]<a[j])
                swap(a[i],a[j]);
    for(i=1;i<=n;i++)printf("%d ",a[i]);
    printf("\n");
    return 0;
}