Among two-digit numbers, find those whose sum of squares is divisible by 13. to Pascal

program zz1;
var a, b, s, i: integer; // set variables of integer type
begin
for i: = 10 to 99 do // iterate over all two-digit numbers in a loop
begin
a: = i div 10; // find the first digit of a two-digit number
b: = i mod 10; // find the second digit of a two-digit number
s: = sqr (a) + sqr (b); // calculate the sum of the squares of the digits of a two-digit number
if s mod 13 = 0 // check for divisibility of the resulting sum by 13

then write (i, ”); // print the answer in a line separated by a space
end;

end.