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

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

class No{
public:
	int x;

	No(int a = 0){
		x = a;
	}

	bool operator > (const No a) const{
		return (x < a.x);
	}

	bool operator < (const No a) const{
		return (x > a.x);
	}
};

priority_queue<No> heap;

int main(){
	int n;
	cin >> n;

	for(int i = 1; i <= n; i++){
		int x;
		cin >> x;
		heap.push(No(x));
	}

	for(int i = 1; i <= n; i++){
		cout << heap.top().x << ' ';
		heap.pop();
	}

	cout << endl;
	return 0;
}