#include <fstream>
#include <algorithm>

using namespace std;

int V[500002], N, i, j, aux, ok, Max, p;

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

int main() {
	
	f>>N;
	for (i=1;i<=N;i++)
		f>>V[i];
	
	for (i=N;i>=2;i--) {
		//calc max de la 1 la i
		Max = V[1];
		p = 1;
		for (j=2;j<=i;j++) {
			if (V[j] > Max) {
				Max = V[j];
				p = j;
			}
		}
		aux = V[p];
		V[p] = V[i];
		V[i] = aux;
	}

	
	for (i=1;i<=N;i++)
		g<<V[i]<<" ";
	
	f.close();
	g.close();
	return 0;
}