




'''simple docstring'''







from typing import TYPE_CHECKING

from ...utils import (
    OptionalDependencyNotAvailable,
    _LazyModule,
    is_torch_available,
)


A									={
    "configuration_swiftformer": [
        "SWIFTFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP",
        "SwiftFormerConfig",
        "SwiftFormerOnnxConfig",
    ]
}

try:
   if not is_torch_available():
      raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
   pass
else:
   A									=[
       "SWIFTFORMER_PRETRAINED_MODEL_ARCHIVE_LIST",
       "SwiftFormerForImageClassification",
       "SwiftFormerModel",
       "SwiftFormerPreTrainedModel",
   ]

if TYPE_CHECKING:
   from .configuration_swiftformer import (
       SWIFTFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP,
       SwiftFormerConfig,
       SwiftFormerOnnxConfig,
   )

   try:
      if not is_torch_available():
         raise OptionalDependencyNotAvailable()
   except OptionalDependencyNotAvailable:
      pass
   else:
      from .modeling_swiftformer import (
          SWIFTFORMER_PRETRAINED_MODEL_ARCHIVE_LIST,
          SwiftFormerForImageClassification,
          SwiftFormerModel,
          SwiftFormerPreTrainedModel,
      )

else:
   import sys

   A									=_LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)










'''simple docstring'''







def 		snake_case_							():
    for n in range(1					,     1_0_0_0_0_0_0  ):
        yield n * (n + 1) // 2





def 		snake_case_							(_a			:							Union[str, Any]  ):
    UpperCAmelCase     =	1
    UpperCAmelCase     =	2
    while i * i <= n:
        UpperCAmelCase     =	0
        while n % i == 0:
            n //= i
            multiplicity += 1
        divisors_count *= multiplicity + 1
        i += 1
    if n > 1:
        divisors_count *= 2
    return divisors_count





def 		snake_case_							():
    return next(i for i in triangle_number_generator() if count_divisors(_a  ) > 5_0_0  )


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




