





from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


_SCREAMING_SNAKE_CASE   						=		{"""configuration_umt5""": ["""UMT5Config""", """UMT5OnnxConfig"""]}


try:
						if not is_torch_available():
												raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
						pass
else:
						_SCREAMING_SNAKE_CASE   						=		[
						    """UMT5EncoderModel""",
						    """UMT5ForConditionalGeneration""",
						    """UMT5ForQuestionAnswering""",
						    """UMT5Model""",
						    """UMT5PreTrainedModel""",
						]

if TYPE_CHECKING:
						from .configuration_umta import UMTaConfig, UMTaOnnxConfig

						try:
												if not is_torch_available():
																		raise OptionalDependencyNotAvailable()
						except OptionalDependencyNotAvailable:
												pass
						else:
												from .modeling_umta import (
												    UMTaEncoderModel,
												    UMTaForConditionalGeneration,
												    UMTaForQuestionAnswering,
												    UMTaModel,
												    UMTaPreTrainedModel,
												)
else:
						import sys

						_SCREAMING_SNAKE_CASE   						=		_LazyModule(__name__, globals()["""__file__"""], _import_structure, module_spec=__spec__)






def    UpperCAmelCase					(  lowercase__						:					int = 998001	):



			'''simple docstring'''





			for number in range(n - 1				,					9999				,					-1	):
						a__					=  str(lowercase__	)

						# checks whether 'str_number' is a palindrome.
						if str_number == str_number[::-1]:
									a__					=  999

									# if 'number' is a product of two 3-digit numbers
									# then number is the answer otherwise fetch next number.
									while divisor != 99:
												if (number % divisor == 0) and (len(str(number // divisor	)	) == 3.0):
															return number
												divisor -= 1
			raise ValueError("""That number is larger than our acceptable range."""	)


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

