program quicksortt;
type vect=array[1..500000]of int64;
var n:int64;
    v:vect;
    i:longint;
    f,g:text;
    intrare,iesire:array[1..1 shl 17]of char;
procedure swap(var aa:int64;var bb:int64);
var aux:int64;
begin
  aux:=aa;
  aa:=bb;
  bb:=aux;
end;

procedure quicksort(var v:vect;st,dr:int64);
var i,j,pivot,aux,a:int64;
begin
i:=st; j:=dr; //a:=random(dr-st)+st;
pivot:=v[st];//v[a]
repeat
while (i < dr) and (v[i] < pivot) do inc(i);
while (j > st) and (pivot < v[j]) do dec(j);
if i<=j then
            begin
            if i<j then swap(v[i],v[j]);
            if i<dr then inc(i);
            if j>st then dec(j);
            end;
until i>j;
if j>st then quicksort(v,st,j);
if i<dr then quicksort(v,i,dr);
end;

begin
assign(f,'algsort.in');settextbuf(f,intrare);reset(f);
assign(g,'algsort.out');settextbuf(g,iesire);rewrite(g);
//randomize;
readln(f,n);
for i:=1 to n do read(f,v[i]);
quicksort(v,1,n);
for i:=1 to n do write(g,v[i],' ');
close(f);close(g);
end.