#include <fstream>
#include <algorithm>

using namespace std;

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

int main() {
	ifstream f("algsort.in");
	ofstream g("algsort.out");
	
	f>>n;
	for (i=1;i<=n;i++) {
		f>>v[i];
	}
	
	do {
		
		ok = 1;
		for (i=1;i<=n-1;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]<<" ";
	
	return 0;
}