#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
int n;
int main()
{
    int i, q=0;
    vector<int> v;
    char s[1000002];
    freopen("algsort.out", "w", stdout);
    freopen("algsort.in", "r", stdin);
    scanf("%d\n", &n);
    gets(s);
    for(i=0;s[i]!='\0';++i)
        if(s[i]!=' ')
            v.push_back(int(s[i])-int('0'));
    sort(v.begin(), v.end());
    for(i=0;i<n;++i)
        printf("%d ", v[i]);
    printf("\n");
    return 0;
}