




'''simple docstring'''





from ..utils import DummyObject, requires_backends




class      UpperCamelCase       (	metaclass=snake_case__       ):
  a     :str          =					['torch', 'librosa']



  def __init__(			self		,     *__lowerCAmelCase		,     **__lowerCAmelCase ):







      '''simple docstring'''


      requires_backends(self		,     ["""torch""", """librosa"""] )



  @classmethod
  def     a_							(			cls		,     *__lowerCAmelCase		,     **__lowerCAmelCase ):







      '''simple docstring'''


      requires_backends(cls		,     ["""torch""", """librosa"""] )



  @classmethod
  def     a_							(			cls		,     *__lowerCAmelCase		,     **__lowerCAmelCase ):







      '''simple docstring'''


      requires_backends(cls		,     ["""torch""", """librosa"""] )






class      UpperCamelCase       (	metaclass=snake_case__       ):
  a     :Dict          =					['torch', 'librosa']



  def __init__(			self		,     *__lowerCAmelCase		,     **__lowerCAmelCase ):







      '''simple docstring'''


      requires_backends(self		,     ["""torch""", """librosa"""] )



  @classmethod
  def     a_							(			cls		,     *__lowerCAmelCase		,     **__lowerCAmelCase ):







      '''simple docstring'''


      requires_backends(cls		,     ["""torch""", """librosa"""] )



  @classmethod
  def     a_							(			cls		,     *__lowerCAmelCase		,     **__lowerCAmelCase ):







      '''simple docstring'''


      requires_backends(cls		,     ["""torch""", """librosa"""] )







UpperCAmelCase__  =			10**8





def 				A      (	_UpperCAmelCase							:  int       )							->					bool:







			'''simple docstring'''
			if n % 10 == 0:
						return False
			_UpperCAmelCase									=  str(_UpperCAmelCase       )
			return s == s[::-1]





def 				A      (	)							->					int:







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

			return sum(_UpperCAmelCase       )


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