type IntRange = 1 .. Maximum; var N: IntRange; begin for N := 1 to Maximum do if Palindrome(Sqr(N)) then Writeln(N, , squared is a palindrome.') end { IsItAPalindrome } . 

## Example 1 Step 3: 

program IsItAPalindrome(Output); { Find all integers from 1 to 100 whose squares are palindromes. } const Maximum = 100; type IntRange Positive var 1 .. Maximum; 1 .. Maxlnt; N: IntRange; function Palindrome (Square: Positive): Boolean; var NPlaces: 1 .. S {S = Trunc(Log10(Sqr(Maximum))+1)}; begin { Palindrome } CrackDigits; Palindrome := CheckSymmetry(l, NP1aces) end { Palindrome }; begin for N := 1 to Maximum do if Pa1indrome(Sqr(N)) then Writeln(N, , squared is a palindrome.') end { IsItAPalindrome } . 

## Example 1 Step 4: 

program IsItAPalindrome(Output); { Find all integers from 1 to 100 whose squares are palindromes. } const Maximum = 100; 

