var f,g:text;
    n,i,j,min:0..500000;
    a:array[1..5000]of longint;
procedure sort(l,r:longint);
var i,j,x,y:longint;
begin
   i:=l;
   j:=r;
   x:=a[(l+r) div 2];
   repeat
      while(a[i]<x) do inc(i);
      while(x<a[j]) do dec(j);
      if(i<=j) then
      begin
         y:=a[i];
         a[ii]:=a[j];
         a[jj]:=y;
         inc(i);
         dec(j);
      end;
   until(i>j);
   if(l<i) then sort(l,j);
   if(i<r) then sort(i,r);

end;
begin
   assign(f,'algsort.in');
   assign(g,'algsort.out');
   reset(f);
   rewrite(g);
   read(f,n);
   for i:=1 to n do
      read(f,a[i]);
   sort(1,n);
   for i:=1 to n do
      write(g,a[i],' ');
   close(f);
   close(g);
end.