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