






__UpperCAmelCase      =				1_0**8





def 						A_					(						lowercase_			)				->bool:







 """simple docstring"""

 if n % 1_0 == 0:
  return False
 SCREAMING_SNAKE_CASE				    =		str(lowercase_			)
 return s == s[::-1]





def 						A_					(						)				->int:







 """simple docstring"""

 SCREAMING_SNAKE_CASE				    =		set()
 SCREAMING_SNAKE_CASE				    =		1
 SCREAMING_SNAKE_CASE				    =		5
 while sum_squares < LIMIT:
  SCREAMING_SNAKE_CASE				    =		first_square + 1
  while sum_squares < LIMIT:
   if is_palindrome(lowercase_			):
    answer.add(lowercase_			)
   last_square += 1
   sum_squares += last_square**2
  first_square += 1
  SCREAMING_SNAKE_CASE				    =		first_square**2 + (first_square + 1) ** 2

 return sum(lowercase_			)


if __name__ == "__main__":
      print(solution())











def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		str:
       UpperCamelCase_ 							=	word.upper()
       UpperCamelCase_ 							=	0
       UpperCamelCase_ 							=	{}
       UpperCamelCase_ 							=	[]

       for letter in word:
              if letter not in letter_nums:
                     UpperCamelCase_ 							=	str(UpperCamelCase_	)
                     next_num += 1
              word_pattern.append(letter_nums[letter]	)
       return ".".join(UpperCamelCase_	)


if __name__ == "__main__":
     import pprint
     import time

     _UpperCAmelCase										=					time.time()
     with open('dictionary.txt') as in_file:
          _UpperCAmelCase										=					in_file.read().splitlines()

     _UpperCAmelCase										=					{}
     for word in word_list:
          _UpperCAmelCase										=					get_word_pattern(word)
          if pattern in all_patterns:
               all_patterns[pattern].append(word)
          else:
               _UpperCAmelCase										=					[word]

     with open('word_patterns.txt', 'w') as out_file:
          out_file.write(pprint.pformat(all_patterns))

     _UpperCAmelCase										=					round(time.time() - start_time, 2)
     print(f'''Done!  {len(all_patterns):,} word patterns found in {total_time} seconds.''')
     # Done!  9,581 word patterns found in 0.58 seconds.

