Program qsort;
var A : array [1..200000] of longint;
    n,i,pivot : longint;

procedure swap(var x,y : longint);
     var aux: longint;
       begin
          aux:=x;
          x:=y;
          y:=aux;
       end;

procedure qsort ( left, right : longint ) ;
        var i,j, pivot : longint;
          begin
            i:=left; j:=right; pivot:=A[(i+j) div 2];
            repeat
                while A[i]<pivot do i:=i+1;
                while A[j]>pivot do j:=j-1;
                if i<=j then begin
                                  swap(A[i],A[j]);
                                  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,10);
     for i:=1 to n do write(A[i],' ');
     close(input);
     close(output);
end.