#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
#define dim 500002
int v[dim];

struct cmp
{
	bool operator () (const int &a, const int &b)
	{
		return v[a]>v[b];
	}
};

priority_queue <int,vector <int> ,cmp> Heap;


int main()
{
	long n, i;
	ifstream fin("algsort.in");
	ofstream fout("algsort.out");
	
	fin>>n;
	for(i=1;i<=n;++i)
	{
		fin>>v[i];
		Heap.push(i);
	}
	
	
	for(;!Heap.empty();Heap.pop())
		fout<<v[Heap.top()] <<" ";
	
	return 0;
}