#include<fstream>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int v[20], n;
typedef struct lista
{
	int val;
	lista *next;
};
void add_list(lista *&key, int val)
{
	lista *newn = (lista*)malloc(sizeof(lista));
	newn->val = val;
	newn->next = NULL;
	if (key == NULL) {
		key = newn;
		return;
	}
	lista *c = key;
	while (1) {
		if (c->next == NULL) {
			c->next = newn;
			return;
		}
		c = c->next;
	}
}
void radix_sort()
{
	lista *T[10];
	int pas = 1;
	while (1) {
		for (int i = 0; i <= 9; i++) {
			T[i] = NULL;
		}
		for (int i = 1; i <= n; i++) {
			add_list(T[(v[i] / pas) % 10], v[i]);
		}
		int nr = 0, oknr = 0;
		for (int i = 0; i <= 9; i++) {
			lista *c = T[i];
			while (c != NULL) {
				oknr++;
				v[++nr] = c->val;
				c = c->next;
			}
			if (oknr == n && i == 0)
				return;
		}
		pas = pas * 10;
	}
}
int main()
{
	int a, b, c;
	f >> n;
	for (int i = 1; i <= n; ++i) {
		f >> v[i];
	}
	radix_sort();
	for (int i = 1; i <= n; i++) {
		g<<v[i]<<" ";
	}
	return 0;
}