#include <stdio.h>
#include <fstream>
#include <queue>


using namespace std;

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


struct comparator{
	bool operator()(int x, int y){
		return x > y;
	}
};

int N;
priority_queue<int, vector<int>, comparator> Q;

int main(){

	in >> N;
	int x;
	for(int i = 1; i <= N; ++i){
		in >> x;
		Q.push(x);
	}

	for(int i = 1; i <= N; ++i){
		out << Q.top() << " ";
		Q.pop();
	}
}