Program qsort;
var A : array [1..500001] of int64;
    i : longint;
    n : int64;

procedure qsort ( left, right : longint ) ;
        var i,j, pivot,aux : longint;
          begin
            i:=left; j:=right; pivot:=A[(right+left) div 2 + 1];
            repeat
                while A[i]<pivot do i:=i+1;
                while A[j]>pivot do j:=j-1;
                if i<=j then begin
                                  aux:=A[i];
                                  A[i]:=A[j];
                                  A[j]:=aux;
                                  i:=i+1;
                                  j:=j-1;
                             end;
            until i>j;
            if i<right then qsort(i,right);
            if j>left then qsort(left,j);
          end;

begin
     assign(input,'algsort.in'); reset(input);
     assign(output,'algsort.out'); rewrite(output);
     readln(n);
     for i:=1 to n do read(A[i]);
     qsort(1,n);
     for i:=1 to n do write(A[i],' ');
     close(input);
     close(output);
end.