var a:array[1..100000] of longint;
    i,n:longint;
procedure qsort(l,r:longint);
var i,j,mid,p:longint;
begin
  i:=l; j:=r;
  mid:=a[(l+r) div 2];
  while i<=j do
  begin
    while a[i]<mid do inc(i);
    while a[j]>mid do dec(j);
    if i<=j then
    begin
      p:=a[i];
      a[i]:=a[j];
      a[j]:=p;
      inc(i);
      dec(j);
    end;
  end;
  if l<j then qsort(l,j);
  if i<r then qsort(i,r);
end;
 
begin
  read(n);
  for i:=1 to n do
    read(a[i]);
  qsort(1,n);
  for i:=1 to n do
    write(a[i],' ');
end.
/**************************************************************
	Problem: 2171
	User: admin
	Language: Pascal
	Result: Wrong Answer
****************************************************************/