program PascalGuru;
type
cisla = 0 .. 50;
var
A: array [1 .. 50, 1 .. 50] of integer;
i, j, n, summa: integer;
s1, s2: set of cisla;
begin
write('N= ');
readln(n);
s1 := [1, 2, 3]; { ---> vot tut zadayutsya MNOZhESTVA }
s2 := [2, 3, 4]; { ---> vot tut zadayutsya MNOZhESTVA }
for i := 1 to n do
for j := 1 to n do
begin
write('A[', i, ',', j, ']=');
readln(A[i, j]);
end;
for i := 1 to n do
begin
writeln;
for j := 1 to n do
write(A[i, j]:8);
end;
{ ****************************************** }
summa := 0;
for i := 1 to n do
for j := 1 to n do
if (i in s1) and (j in s2) then { proverka prinadlezhnosti k mnojestvam }
summa := summa + A[i, j];
writeln;
writeln('Summa: ', summa);
readln;
end.