#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[500010],i,j;
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=1;i<=n-1;i++)
        for(j=i+1;j<=n;j++) if(a[i]>a[j]) swap(a[i],a[j]);
    for(i=1;i<=n;i++) printf("%d ",a[i]);
    return 0;
}