#include <fstream>
#include <algorithm>

using namespace std;

int v[500010];
int n, i, aux, j;

int main() {
	ifstream f("algsort.in");
	ofstream g("algsort.out");
	
	f>>n;
	for (i=1;i<=n;i++) {
		f>>v[i];
	}
	
	for (i=1;i<n;i++)
		for (j=i+1;j<=n;j++)
			if (v[i] > v[j]){
				aux = v[i];
				v[i] = v[j];
				v[j] = aux;
			}				
	
	for (i=1;i<=n;i++)
		g<<v[i]<<" ";
	
	return 0;
}