



'''simple docstring'''

_A				:    List[str]     						='''Input must be a string of 8 numbers plus letter'''
_A				:    str     						='''TRWAGMYFPDXBNJZSQVHLCKE'''







def 						__UpperCamelCase				(							_lowercase					) ->			int:






	if not isinstance(_snake_case,				_snake_case					):
		_lowercase					:       List[Any]       =		f'''Expected string as input, found {type(_snake_case					).__name__}'''
		raise TypeError(_snake_case					)

	_lowercase					:       str       =		spanish_id.replace('-',				''					).upper()
	if len(_snake_case					) != 9:
		raise ValueError(_snake_case					)

	try:
		_lowercase					:       Optional[Any]       =		int(spanish_id_clean[0:8]					)
		_lowercase					:       Any       =		spanish_id_clean[8]
	except ValueError as ex:
		raise ValueError(_snake_case					) from ex

	if letter.isdigit():
		raise ValueError(_snake_case					)

	return letter == LOOKUP_LETTERS[number % 23]


if __name__ == "__main__":
		import doctest

		doctest.testmod()





'''simple docstring'''

def 						__UpperCamelCase				(							_lowercase					) ->			bool:
	return str(_lowercase					) == str(_lowercase					)[::-1]







def 						__UpperCamelCase				(							_lowercase					) ->			int:
	return int(_lowercase					) + int(str(_lowercase					)[::-1]					)







def 						__UpperCamelCase				(							_lowercase = 1_0000					) ->			int:
	_lowercase					:       List[str]       =		[]
	for num in range(1,				_lowercase					):
		_lowercase					:       Tuple       =		0
		_lowercase					:       Tuple       =		num
		while iterations < 50:
			_lowercase					:       Union[str, Any]       =		sum_reverse(_lowercase					)
			iterations += 1
			if is_palindrome(_lowercase					):
				break
		else:
			lychrel_nums.append(_lowercase					)
	return len(_lowercase					)


if __name__ == "__main__":
		print(F'''{solution() = }''')
