#include <fstream>

int v[500001];

void sort(int* v, int n) {
	int i, j, temp;

	bool swap;

	for (i = 0; i < n - 1; ++i) {
		swap = false;

		for (j = 0; j < n - i - 1; ++j) {
			if (v[j] > v[j + 1]) {
				temp = v[j];
				v[j] = v[j + 1];
				v[j + 1] = temp;

				swap = true;
			}
		}

		if (!swap)
			break;
	}
}

int main() {
	std::ifstream fin("algsort.in");
	std::ofstream fout("algsort.out");

	int n;

	fin >> n;

	for (int i = 0; i < n; ++i)
		fin >> v[i];

	fin.close();

	sort(v, n);

	for (int i = 0; i < n; ++i)
		fout << v[i] << ' ';
	fout << '\n';

	fout.close();

	return 0;
}