program sort;
var v:array[1..100] of longint;
    aux,i,j,n:longint;
begin
assign(input,'algsort.in');
reset(input);
read(input,n);
for i:=1 to n do
    read(input,v[i]);
close(input);
for i:=2 to n do
    if v[i]<v[i-1] then begin
       j:=i;
       while (v[j]<v[j-1])and(j>1) do begin
             aux:=v[j];
             v[j]:=v[j-1];
             v[j-1]:=aux;
             dec(j);
             end;
       end;
assign(output,'algsort.out');
rewrite(output);
for i:=1 to n do
    write(output,v[i]);
close(output);
end.