#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> v(n);
	for (int i = 0; i < n; i++) {
		cin >> v[i];
	}
	
	int min = *min_element(v.begin(), v.end());
	
	vector<int> count(108);
	for (int i = 0; i < n; i++) {
		count[v[i] - min] += 1;
	}

	int curr = 0;
	for (int i = 0; i < count.size(); i++) {
		for (int j = 0; j < count[i]; j++) {
			v[curr] = i + min;
			curr++;
		}
	}
	
	for (int i = 0; i < v.size(); i++) {
		cout << v[i] << ' ';
	}
	
	return 0;
}