Insert sorting algotihm problem

[JaBa]

Hi. I have problem with my insert sorting algorithm. Here is code:

This code sorts: 1,2,3,4,5,6

          for j:=1 to y do 
              begin
                tmp:=mas[i,j];
                n:=j-1;
                while ((n>=0) and (mas[i,n]>tmp)) do
                      begin
                        mas[i,n+1] := mas[i,n];
                        n:=n-1;
                      end;
                mas[i,n+1]:=tmp;
              end;

But I need to this code sorts: 6,5,4,3,2,1

       for j:=1 to y do
         begin
           tmp:=mas[i,j];
           n:=j-1;
           while ((n>=0) and (mas[i,n]>tmp)) do
             begin
              mas[i,n+1] := mas[i,n];
              n:=n-1;
             end;
           mas[i,n+1]:=tmp;
         end;
     end;

So what I need to change in second code example to make it sort: from bigger number to smaller?