


from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


lowerCamelCase		=						{'''configuration_sew_d''': ['''SEW_D_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''SEWDConfig''']}

try:
		if not is_torch_available():
				raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
		pass
else:
		lowerCamelCase		=						[
		    '''SEW_D_PRETRAINED_MODEL_ARCHIVE_LIST''',
		    '''SEWDForCTC''',
		    '''SEWDForSequenceClassification''',
		    '''SEWDModel''',
		    '''SEWDPreTrainedModel''',
		]

if TYPE_CHECKING:
		from .configuration_sew_d import SEW_D_PRETRAINED_CONFIG_ARCHIVE_MAP, SEWDConfig

		try:
				if not is_torch_available():
						raise OptionalDependencyNotAvailable()
		except OptionalDependencyNotAvailable:
				pass
		else:
				from .modeling_sew_d import (
				    SEW_D_PRETRAINED_MODEL_ARCHIVE_LIST,
				    SEWDForCTC,
				    SEWDForSequenceClassification,
				    SEWDModel,
				    SEWDPreTrainedModel,
				)


else:
		import sys

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








import math






def 	lowerCamelCase_       (			_a			):




		"""simple docstring"""






		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(_a			) + 1			)      ,  6			):
				if number % i == 0 or number % (i + 2) == 0:
						return False
		return True






def 	lowerCamelCase_       (			_a = 1_000      ,  _a = 1_000			):




		"""simple docstring"""






		lowerCAmelCase__  :     Union[str, Any]       	=   [0, 0, 0]  # length, a, b
		for a in range((a_limit * -1) + 1      ,  _a			):
				for b in range(2      ,  _a			):
						if is_prime(_a			):
								lowerCAmelCase__  :     str       	=   0
								lowerCAmelCase__  :     int       	=   0
								while is_prime((n**2) + (a * n) + b			):
										count += 1
										n += 1
								if count > longest[0]:
										lowerCAmelCase__  :     Dict       	=   [count, a, b]
		lowerCAmelCase__  :     int       	=   longest[1] * longest[2]
		return ans


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




