#include<fstream>
#include<cstdio>

#define maxn 500005

using namespace std;

ifstream f("algsort.in");
FILE*g=fopen("algsort.out","w");

const int base = 65535,pbase = 16;
int n,A[maxn],AUX[maxn],Count[base];

inline void radix ( int *A ){
	
	int step = 0;
	for ( int pasi = 1 ; pasi <= 2; ++pasi ){
		
		for ( int i = 1 ; i <= n ; ++i ){
			++Count[ (A[i]>>step)&base ];
		}
		for ( int i = 0 ; i <= base ; ++i ){
			Count[i] += Count[i-1];
		}
		
		for ( int i = n ; i >= 1 ; --i ){
			int last = ((A[i]>>step)&base);
			AUX[ Count[last]-- ] = A[i];
		}
		
		step += pbase;
		for ( int i = 1 ; i <= n ; ++i ){
			A[i] = AUX[i];
		}
		for ( int i = 0 ; i <= base ; ++i ){
			Count[i] = 0;
		}
	}
}

int main () {
	
	f >> n;
	for ( int i = 1 ; i <= n ; ++i ){
		f >> A[i];
	}
	
	radix(A);
	
	for ( int i = 1 ; i <= n ; ++i ){
		fprintf(g,"%d ",A[i]);
	}
	fprintf(g,"\n");
	
	f.close();
	fclose(g);
	
	return 0;
}