#include <fstream>
#include <algorithm>

using namespace std;

int V[1900000], 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>>j;
		V[j]++;
		if (j>Max) {
			Max = j;
		}
	}
	
	

	
	for (i=0;i<=Max;i++) {
		while (V[i]!=0) {
			g<<i<<" ";
			V[i]--;
		}
	}
	
	f.close();
	g.close();
	return 0;
}