#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

vector <int> a;

int main() {
	int N, elem;
	ifstream f("algsort.in");
	ofstream g("algsort.out");

	f >> N;
	for (int i = 0; i < N; ++i) {
		f >> elem;
		a.push_back(elem);
	}

	sort(a.begin(), a.end());

	for (int i = 0; i < N; ++i) {
		g << a[i] << " ";
	}

	return 0;
}