



from typing import TYPE_CHECKING

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


snake_case_    					=	{
    """configuration_mega""": ["""MEGA_PRETRAINED_CONFIG_ARCHIVE_MAP""", """MegaConfig""", """MegaOnnxConfig"""],
}

try:
				if not is_torch_available():
								raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
				pass
else:
				snake_case_    					=	[
				    """MEGA_PRETRAINED_MODEL_ARCHIVE_LIST""",
				    """MegaForCausalLM""",
				    """MegaForMaskedLM""",
				    """MegaForMultipleChoice""",
				    """MegaForQuestionAnswering""",
				    """MegaForSequenceClassification""",
				    """MegaForTokenClassification""",
				    """MegaModel""",
				    """MegaPreTrainedModel""",
				]

if TYPE_CHECKING:
				from .configuration_mega import MEGA_PRETRAINED_CONFIG_ARCHIVE_MAP, MegaConfig, MegaOnnxConfig

				try:
								if not is_torch_available():
												raise OptionalDependencyNotAvailable()
				except OptionalDependencyNotAvailable:
								pass
				else:
								from .modeling_mega import (
								    MEGA_PRETRAINED_MODEL_ARCHIVE_LIST,
								    MegaForCausalLM,
								    MegaForMaskedLM,
								    MegaForMultipleChoice,
								    MegaForQuestionAnswering,
								    MegaForSequenceClassification,
								    MegaForTokenClassification,
								    MegaModel,
								    MegaPreTrainedModel,
								)

else:
				import sys

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










"""simple docstring"""


def 			_lowerCAmelCase				(       ):
						for n in range(1		,     1000000						):
												yield n * (n + 1) // 2

def 			_lowerCAmelCase				(       lowercase_						):
						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 			_lowerCAmelCase				(       ):
						return next(i for i in triangle_number_generator() if count_divisors(lowercase_						) > 500						)


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





