#include <fstream>
#include <algorithm>

using namespace std;

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

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

int main() {
	
	f>>N;
	for (i=1;i<=N;i++)
		f>>V[i];
	
	
	do {
		ok = 1;
		for (i=1;i<N;i++)
			if (V[i] > V[i+1]) {
				aux = V[i];
				V[i] = V[i+1];
				V[i+1] = aux;
				ok = 0;
			}
	} while (ok == 0);
	
	for (i=1;i<=N;i++)
		g<<V[i]<<" ";
	
	f.close();
	g.close();
	return 0;
}