#include <cstdio>
#include <algorithm>

using namespace std;

int n,a[500005];

int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<n;i++)
        for(int j=i+1;j<=n;j++)
            if(a[i]>a[j])
                swap(a[i],a[j]);
    for(int i=1;i<=n;i++)
        printf("%d ",a[i]);
    return 0;
}