



"""simple docstring"""





from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


lowerCamelCase      =		{"""configuration_vit_msn""": ["""VIT_MSN_PRETRAINED_CONFIG_ARCHIVE_MAP""", """ViTMSNConfig"""]}

try:
  if not is_torch_available():
    raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
  pass
else:
  lowerCamelCase      =		[
      """VIT_MSN_PRETRAINED_MODEL_ARCHIVE_LIST""",
      """ViTMSNModel""",
      """ViTMSNForImageClassification""",
      """ViTMSNPreTrainedModel""",
  ]

if TYPE_CHECKING:
  from .configuration_vit_msn import VIT_MSN_PRETRAINED_CONFIG_ARCHIVE_MAP, ViTMSNConfig

  try:
    if not is_torch_available():
      raise OptionalDependencyNotAvailable()
  except OptionalDependencyNotAvailable:
    pass
  else:
    from .modeling_vit_msn import (
        VIT_MSN_PRETRAINED_MODEL_ARCHIVE_LIST,
        ViTMSNForImageClassification,
        ViTMSNModel,
        ViTMSNPreTrainedModel,
    )

else:
  import sys

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









"""simple docstring"""





from __future__ import annotations

import math
def      a__			(   lowerCAmelCase__   ):

      if 1 < number < 4:
            # 2 and 3 are primes
            return True
      elif number < 2 or number % 2 == 0 or number % 3 == 0:
            # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
            return False

      # All primes number are in format of 6k +/- 1
      for i in range(5			,    int(math.sqrt(lowerCAmelCase__   ) + 1   )			,    6   ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True


lowerCamelCase      =		[num for num in range(3, 100_001, 2) if not is_prime(num)]
def      a__			(   lowerCAmelCase__   ):
      if not isinstance(lowerCAmelCase__			,    lowerCAmelCase__   ):
            raise ValueError("n must be an integer"   )
      if n <= 0:
            raise ValueError("n must be >= 0"   )

      UpperCAmelCase_    				=							[]
      for num in range(len(lowerCAmelCase__   )   ):
            UpperCAmelCase_    				=							0
            while 2 * i * i <= odd_composites[num]:
                  UpperCAmelCase_    				=							odd_composites[num] - 2 * i * i
                  if is_prime(lowerCAmelCase__   ):
                        break
                  i += 1
            else:
                  list_nums.append(odd_composites[num]   )
                  if len(lowerCAmelCase__   ) == n:
                        return list_nums

      return []
def      a__			(   ):
      return compute_nums(1   )[0]


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




