


'''simple docstring'''







A      :     Optional[int]										= 10**8






def       lowerCAmelCase__       (				lowerCamelCase     :			int   ):
       if n % 10 == 0:
              return False
       _A     :	Tuple      =					str(lowerCamelCase   )
       return s == s[::-1]






def       lowerCAmelCase__       (				):
       _A     :	Optional[int]      =					set()
       _A     :	Tuple      =					1
       _A     :	List[Any]      =					5
       while sum_squares < LIMIT:
              _A     :	List[Any]      =					first_square + 1
              while sum_squares < LIMIT:
                     if is_palindrome(lowerCamelCase   ):
                            answer.add(lowerCamelCase   )
                     last_square += 1
                     sum_squares += last_square**2
              first_square += 1
              _A     :	str      =					first_square**2 + (first_square + 1) ** 2

       return sum(lowerCamelCase   )


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










'''simple docstring'''







from __future__ import annotations






def       lowerCAmelCase__       (				lowerCamelCase     :			list   ):
       _A     :	Union[str, Any]      =					sorted(lowerCamelCase   )
       _A     :	Tuple      =					len(lowerCamelCase   )
       _A     :	int      =					length >> 1
       return (
           (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
           if length % 2 == 0
           else sorted_list[mid_index]
       )






def       lowerCAmelCase__       (				):
       import doctest

       doctest.testmod()


if __name__ == "__main__":
   main()






