#include <fstream>
#include <queue>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

struct compare{
	bool operator() (int a, int b) {return a > b;}
};

priority_queue<int, vector<int>, compare> q;
int n, x;

int main(){
	f >> n;
	while(n > 0){
		f >> x;
		q.push(x);
		n--;
	}
	while(!q.empty()){
		g << q.top() << ' ';
		q.pop();
	}

	f.close();
	g.close();
	return 0;
}