type vector=array[1..1000] of longint;
var n,i:integer;
    a:vector;
procedure sort(l:longint;r:longint);
var left,right,mid,aux:integer;
begin
     left:=l;
     right:=r;
     mid:=a[(left+right) shr 1];
     while a[left]<mid do inc(left);
     while a[right]>mid do dec(right);
     if left<=right then begin
        aux:=a[left];
        a[left]:=a[right];
        a[right]:=aux;
        inc(left);
        dec(right);
        end;
     if l<right then sort(l,right);
     if left<r then sort(left,r);
end;
begin
assign(input,'algsort.in');
reset(input);
read(input,n);
for i:=1 to n do read(input,a[i]);
sort(1,n);
assign(output,'algsort.out');
rewrite(output);
for i:=1 to n do
    write(output,a[i]);
close(output);
end.