program SearchMaxNegative;
var
    n, k, j, max, maxIndex: integer;
    matrix: array of array of integer;
begin
    write('n = ');
    readln(n);

    setlength(matrix, n, n);

    writeln('Before update: ');
    for k := 0 to n - 1 do begin
        max := matrix[k, 0];
        maxIndex := 0;

        for j := 0 to n - 1 do begin
            matrix[k, j] := -3 + random(11);
            write(matrix[k, j] : 4, ' ');

            if matrix[k, j] > max then begin
                max := matrix[k, j];
                maxIndex := j;
            end;
        end;

        if (k > 0) and (k < n - 1) then begin
            matrix[k, maxIndex] := 0;
        end;

        writeln;
    end;

    writeln('After update: ');
    for k := 0 to n - 1 do begin
        for j := 0 to n - 1 do begin
            write(matrix[k, j] : 4, ' ');
        end;

        writeln;
    end;
end.