program group;
var n,m,j,i:longint;
    a:array[1..10000]of longint;

procedure qsort(s,t:longint);
var i,j,temp,min:longint;
begin
  assign(input,'group.in');
  assign(output,'group.out');
  reset(input);
  rewrite(output);
  i:=s;j:=t;min:=a[(s+t)div 2];
  while i<=j do
  begin
    while a[i]<min do inc(i);
      while a[j]>min do dec(j);
      if i<=j then
      begin
        temp:=a[i];
         a[i]:=a[j];
         a[j]:=temp;
         inc(i);
         dec(j);
      end;
  end;
   if i<t then qsort(i,t);
      if s<j then qsort(s,j);
end;

begin
  while not eof do
  begin
    read(n);
     for i:=1 to n do
    read(a[i]);
     qsort(1,n);
     for i:=1 to n-1 do
    write(a[i],' ');
    writeln(a[n]);
  end;

 close(input);
 close(output);
end.