#include <iostream>
#include <ctime>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <vector>

using namespace std;

const int nmax = int(5e5), base = 256;
int n;
int a[nmax];
vector<int> bucket[base];

void lsdRadixSort() {
	for(int k = 0;k < 3;k++) {
		for(int i = 0;i < n;i++) {
			bucket[a[i]>>(8*k) & 255].push_back(a[i]);
		}
		int num = 0;
		for(int digit = 0;digit < base;digit++) {
			for(int i = 0;i < (int)bucket[digit].size();i++) {
				a[num++] = bucket[digit][i];
			}
			bucket[digit].clear();
		}
	}
}

void readData() {
	scanf("%d",&n);
	 for(int i = 0;i < n;i++) {
		 scanf("%d",&a[i]);
	 }
}

void printData() {
	for(int i = 0;i < n;i++) {
		printf("%d ",a[i]);
	}
	printf("\n");
}


int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	readData();
	lsdRadixSort();
	printData();
	return 0;
}