




UpperCamelCase__						=		1_0**8






def    snake_case   (				A     )				->				bool:




	'''simple docstring'''


	if n % 10 == 0:
		return False
	lowerCamelCase_				:						Union[str, Any]				  =				str(A     )
	return s == s[::-1]






def    snake_case   (				)				->				int:




	'''simple docstring'''


	lowerCamelCase_				:						List[str]				  =				set()
	lowerCamelCase_				:						Any				  =				1
	lowerCamelCase_				:						Optional[int]				  =				5
	while sum_squares < LIMIT:
		lowerCamelCase_				:						List[str]				  =				first_square + 1
		while sum_squares < LIMIT:
			if is_palindrome(A     ):
				answer.add(A     )
			last_square += 1
			sum_squares += last_square**2
		first_square += 1
		lowerCamelCase_				:						Dict				  =				first_square**2 + (first_square + 1) ** 2

	return sum(A     )


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


'''simple docstring'''





from ...utils import (
    OptionalDependencyNotAvailable,
    is_torch_available,
    is_transformers_available,
    is_transformers_version,
)


try:
 if not (is_transformers_available() and is_torch_available() and is_transformers_version(">=", "4.27.0")):
  raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
 from ...utils.dummy_torch_and_transformers_objects import (
     AudioLDMPipeline,
 )
else:
 from .pipeline_audioldm import AudioLDMPipeline






