/*

Priority Queue din stl

*/

#include <cstdio>
#include <queue>
#include <vector>

using namespace std;

#define FIN "algsort.in"
#define FOUT "algsort.out"
struct sortare{
	bool operator()(int a,int b){
		return a > b ;
	}
};

priority_queue<int, vector<int>, sortare> Q;

int main(){
	int N, x;
	freopen(FIN, "r", stdin);
	freopen(FOUT, "w", stdout);
	scanf("%d", &N);
	while (N --){
		scanf("%d", &x);
		Q.push(x);
	}
	while (!Q.empty()){
		printf("%d ", Q.top());
		Q.pop();
	}
}