#include <cstdio>
#include <cstdlib>
#include <stack>
#include <algorithm>
using namespace std;
const int MAXN = 1000;
int val[MAXN];
int n;
void InsertSort() {
	int current;
	for (int i = 1;i < n;i++) {
		current = val[i];
		for (int j = 0;j < i;j++)
			if (val[j] > current) {
				for (int k = i;k > j;k--) {
					val[k] = val[k - 1];
				}
				val[j] = current;
				break;
			}
	}
}
int main() {
	scanf("%d", &n);
	for (int i = 0;i < n;i++) {
		scanf("%d", &val[i]);
	}
	InsertSort();
	for (int i = 0;i < n;i++) {
		printf("%d ", val[i]);
	}
	puts("");
	return 0;
}
/**************************************************************
	Problem: 2171
	User: admin
	Language: C++
	Result: Accepted
	Time:10 ms
	Memory:1148 kb
****************************************************************/