code: from typing import TYPE_CHECKING
  
  from ...utils import (
      OptionalDependencyNotAvailable,
      _LazyModule,
      is_torch_available,
  )
  
  
  a     :			Dict					    =						{
      "configuration_align": [
          "ALIGN_PRETRAINED_CONFIG_ARCHIVE_MAP",
          "AlignConfig",
          "AlignTextConfig",
          "AlignVisionConfig",
      ],
      "processing_align": ["AlignProcessor"],
  }
  
  try:
   if not is_torch_available():
    raise OptionalDependencyNotAvailable()
  except OptionalDependencyNotAvailable:
   pass
  else:
   a     :			int					    =						[
       "ALIGN_PRETRAINED_MODEL_ARCHIVE_LIST",
       "AlignModel",
       "AlignPreTrainedModel",
       "AlignTextModel",
       "AlignVisionModel",
   ]
  
  if TYPE_CHECKING:
   from .configuration_align import (
       ALIGN_PRETRAINED_CONFIG_ARCHIVE_MAP,
       AlignConfig,
       AlignTextConfig,
       AlignVisionConfig,
   )
   from .processing_align import AlignProcessor
  
   try:
    if not is_torch_available():
     raise OptionalDependencyNotAvailable()
   except OptionalDependencyNotAvailable:
    pass
   else:
    from .modeling_align import (
        ALIGN_PRETRAINED_MODEL_ARCHIVE_LIST,
        AlignModel,
        AlignPreTrainedModel,
        AlignTextModel,
        AlignVisionModel,
    )
  
  else:
   import sys
  
   a     :			Optional[int]					    =						_LazyModule(__name__, globals()["""__file__"""], _import_structure, module_spec=__spec__)
style_context: def 		snake_case__  (		lowercase = 998001				):
  
     # fetches the next number
     for number in range(n - 1       ,							9999       ,							-1				):
        lowerCAmelCase_:       str         =  str(lowercase				)
  
        # checks whether 'str_number' is a palindrome.
        if str_number == str_number[::-1]:
           lowerCAmelCase_:       List[str]         =  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() = }''')