#include <stdio.h>
#include <queue>
std::priority_queue<int>s;
int a[500005];

int main(){
    int n,x;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&x);
            s.push(x); }
        n=0;
        for(;s.size()>0;){
            a[++n]=s.top();
            s.pop(); }
        for(;n>0;n--)printf("%d ",a[n]);
}