program sort;

  const n = 1000;

  var
    i,
    j,
    k,
    m: integer;
    a: array [1 .. n] of integer;

  begin
    for k := 1 to n do a[k] := k;
    for i := 1 to n - 1 do
      begin
        k := i;
        m := a[i];
        for j := i + 1 to n do
          if a[j] > m
          then
            begin
              k := j;
              m := a[j]
            end;
        a[k] := a[i];
        a[i] := m
      end
  end.