#include<cstdio>
#include<algorithm>
using namespace std;
unsigned long long v[500001],vc[500001];
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    int n,i,max = 0;
    scanf("%d",&n);
    for( i = 1 ; i <= n ; i++ ){
        scanf("%d",&v[i]);
        vc[v[i]]++;
        if ( max < v[i] )
            max = v[i];
    }
    for ( i = 1 ; i <= max ; i++ ){
        while ( vc[i] != 0 ){
            printf("%d ",i);
            vc[i]--;
    }
    }
    return 0;
}