

"""simple docstring"""






from typing import TYPE_CHECKING

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


lowerCamelCase__			:					List[Any]							  =					{
    '''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:
						lowerCamelCase__			:					str							  =					[
						    '''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

						lowerCamelCase__			:					Optional[int]							  =					_LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)








"""simple docstring"""






import math
def  UpperCamelCase   (     _lowerCAmelCase       :  int	)			->     bool:

	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
def  UpperCamelCase   (     _lowerCAmelCase       :  int = 2000000	)			->     int:
	return sum(num for num in range(3,					_lowerCAmelCase,					2	) if is_prime(_lowerCAmelCase	)	) + 2 if n > 2 else 0


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





