// Arhiva educationala - Sortare prin comparare
// Implementare LSD Radix Sort pe 2 biti
// Timp constant n*16


var
        n, i, key, k	: longint;
        v 				: array[1..500000] of longint;
		vKey			: array[0..3] of array [0..500000] of longint;
        f               : text;
		buf 			: array[1..65000] of byte;


begin
assign  (f, 'algsort.in');
reset   (f);
settextbuf (f, buf);
readln  (f, n);
for i := 1 to n do read (f,v[i]);
close   (f);

for k := 0 to 30 do
    begin
    if (k mod 2 = 1) then continue;
    vKey[0][0] := 0; vKey[1][0] := 0; vKey[2][0] := 0; vKey[3][0] := 0;

	for i := 1 to n do
        begin
        key := (v[i] shr k) and 3;
		inc(vKey[key][0]);
        vKey[key][vKey[key][0]]:=v[i];
        end;

	n := 0;
	for key := 0 to 3 do
		for i := 1 to vKey[key][0] do
			begin
			inc (n);
			v[n] := vkey[key][i];
			end;

	end;

assign  (f,'algsort.out');
rewrite (f);

for i:=1 to n do write (f,v[i],' ');
close   (f);
end.