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