


UpperCamelCase :				Dict						    =       10**8
def 							UpperCamelCase_  (				__snake_case			:						int     )->      bool:




      '''simple docstring'''
      if n % 10 == 0:
            return False
      __magic_name__ 		=			str(__snake_case     )
      return s == s[::-1]
def 							UpperCamelCase_  (				)->      int:




      '''simple docstring'''
      __magic_name__ 		=			set()
      __magic_name__ 		=			1
      __magic_name__ 		=			5
      while sum_squares < LIMIT:
            __magic_name__ 		=			first_square + 1
            while sum_squares < LIMIT:
                  if is_palindrome(__snake_case     ):
                        answer.add(__snake_case     )
                  last_square += 1
                  sum_squares += last_square**2
            first_square += 1
            __magic_name__ 		=			first_square**2 + (first_square + 1) ** 2

      return sum(__snake_case     )


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





def 							UpperCamelCase_  (				__snake_case			:						list[int]     )->      tuple[int, int]:




						'''simple docstring'''
						# base case
						if len(__snake_case     ) == 1:
												return a[0], a[0]
						else:
												# split A into half.
												__magic_name__ 		=			a[: len(__snake_case     ) // 2]
												__magic_name__ 		=			a[len(__snake_case     ) // 2 :]

												# 2 sub problems, 1/2 of original size.
												__magic_name__		,			__magic_name__ 		=			max_difference(__snake_case     )
												__magic_name__		,			__magic_name__ 		=			max_difference(__snake_case     )

												# get min of first and max of second
												# linear time
												__magic_name__ 		=			min(__snake_case     )
												__magic_name__ 		=			max(__snake_case     )

												# 3 cases, either (small1, big1),
												# (min_first, max_second), (small2, big2)
												# constant comparisons
												if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
																		return smalla, biga
												elif biga - smalla > max_second - min_first:
																		return smalla, biga
												else:
																		return min_first, max_second


if __name__ == "__main__":
					import doctest

					doctest.testmod()

