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