#include <fstream>
#include <queue>
using namespace std;
priority_queue <int> q;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
const int nmax=500000;
int x[nmax+5],n;
void read(){
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>x[i];
}
void solve(){
    for(int i=1;i<=n;i++)
        q.push(x[i]);
    for(int i=n;i>=1;i--){
        x[i]=q.top();
        q.pop();
    }
}
void print(){
    for(int i=1;i<=n;i++)
        fout<<x[i]<<" ";
}
int main()
{
    read();
    solve();
    print();
    return 0;
}