





from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


UpperCAmelCase		:  str         =	{
    '''configuration_megatron_bert''': ['''MEGATRON_BERT_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''MegatronBertConfig'''],
}

try:
				if not is_torch_available():
								raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
				pass
else:
				UpperCAmelCase		:  int         =	[
				    '''MEGATRON_BERT_PRETRAINED_MODEL_ARCHIVE_LIST''',
				    '''MegatronBertForCausalLM''',
				    '''MegatronBertForMaskedLM''',
				    '''MegatronBertForMultipleChoice''',
				    '''MegatronBertForNextSentencePrediction''',
				    '''MegatronBertForPreTraining''',
				    '''MegatronBertForQuestionAnswering''',
				    '''MegatronBertForSequenceClassification''',
				    '''MegatronBertForTokenClassification''',
				    '''MegatronBertModel''',
				    '''MegatronBertPreTrainedModel''',
				]

if TYPE_CHECKING:
				from .configuration_megatron_bert import MEGATRON_BERT_PRETRAINED_CONFIG_ARCHIVE_MAP, MegatronBertConfig

				try:
								if not is_torch_available():
												raise OptionalDependencyNotAvailable()
				except OptionalDependencyNotAvailable:
								pass
				else:
								from .modeling_megatron_bert import (
								    MEGATRON_BERT_PRETRAINED_MODEL_ARCHIVE_LIST,
								    MegatronBertForCausalLM,
								    MegatronBertForMaskedLM,
								    MegatronBertForMultipleChoice,
								    MegatronBertForNextSentencePrediction,
								    MegatronBertForPreTraining,
								    MegatronBertForQuestionAnswering,
								    MegatronBertForSequenceClassification,
								    MegatronBertForTokenClassification,
								    MegatronBertModel,
								    MegatronBertPreTrainedModel,
								)

else:
				import sys

				UpperCAmelCase		:  Tuple         =	_LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)






from __future__ import annotations

import math





def      lowerCamelCase_					(							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


__A							=[num for num in range(3, 1_0_0_0_0_1, 2) if not is_prime(num)]





def      lowerCamelCase_					(							lowerCamelCase__       ):
				if not isinstance(lowerCamelCase__      ,					lowerCamelCase__       ):
								raise ValueError("n must be an integer"       )
				if n <= 0:
								raise ValueError("n must be >= 0"       )

				lowerCamelCase_         =     []
				for num in range(len(lowerCamelCase__       )       ):
								lowerCamelCase_         =     0
								while 2 * i * i <= odd_composites[num]:
												lowerCamelCase_         =     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      lowerCamelCase_					(							):
				return compute_nums(1       )[0]


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


