



'''simple docstring'''
from ...configuration_utils import PretrainedConfig
from ...utils import logging


snake_case_				:			Union[str, Any]        =						logging.get_logger(__name__)

snake_case_				:			Dict        =						{
    "uw-madison/yoso-4096": "https://huggingface.co/uw-madison/yoso-4096/resolve/main/config.json",
    # See all YOSO models at https://huggingface.co/models?filter=yoso
}






class 							lowercase__			(							SCREAMING_SNAKE_CASE__     ):
	lowercase__						       =    """yoso"""





	def __init__(				self      :       Optional[int]				,lowerCamelCase__      :       Optional[int]=50265				,lowerCamelCase__      :       Tuple=768				,lowerCamelCase__      :       int=12				,lowerCamelCase__      :       Optional[Any]=12				,lowerCamelCase__      :       Any=3072				,lowerCamelCase__      :       List[str]="gelu"				,lowerCamelCase__      :       Tuple=0.1				,lowerCamelCase__      :       List[str]=0.1				,lowerCamelCase__      :       str=4096				,lowerCamelCase__      :       Union[str, Any]=1				,lowerCamelCase__      :       Union[str, Any]=0.0_2				,lowerCamelCase__      :       Optional[Any]=1E-12				,lowerCamelCase__      :       Tuple="absolute"				,lowerCamelCase__      :       int=True				,lowerCamelCase__      :       Optional[Any]=9				,lowerCamelCase__      :       int=64				,lowerCamelCase__      :       Tuple=None				,lowerCamelCase__      :       Union[str, Any]=True				,lowerCamelCase__      :       Dict=True				,lowerCamelCase__      :       Optional[Any]=1				,lowerCamelCase__      :       Optional[Any]=0				,lowerCamelCase__      :       Optional[int]=2				,**lowerCamelCase__      :       Optional[int]				,):







							'''simple docstring'''
							super().__init__(pad_token_id=lowerCamelCase__				,bos_token_id=lowerCamelCase__				,eos_token_id=lowerCamelCase__				,**lowerCamelCase__				)

							_UpperCamelCase      :	Optional[Any]				       =     vocab_size
							_UpperCamelCase      :	str				       =     max_position_embeddings
							_UpperCamelCase      :	str				       =     hidden_size
							_UpperCamelCase      :	List[str]				       =     num_hidden_layers
							_UpperCamelCase      :	Tuple				       =     num_attention_heads
							_UpperCamelCase      :	Any				       =     intermediate_size
							_UpperCamelCase      :	Any				       =     hidden_act
							_UpperCamelCase      :	Optional[Any]				       =     hidden_dropout_prob
							_UpperCamelCase      :	Tuple				       =     attention_probs_dropout_prob
							_UpperCamelCase      :	Optional[int]				       =     initializer_range
							_UpperCamelCase      :	Tuple				       =     type_vocab_size
							_UpperCamelCase      :	Tuple				       =     layer_norm_eps
							_UpperCamelCase      :	List[str]				       =     position_embedding_type
							_UpperCamelCase      :	Optional[Any]				       =     use_expectation
							_UpperCamelCase      :	Dict				       =     hash_code_len
							_UpperCamelCase      :	List[Any]				       =     num_hash
							_UpperCamelCase      :	Any				       =     conv_window
							_UpperCamelCase      :	Dict				       =     use_fast_hash
							_UpperCamelCase      :	Optional[Any]				       =     lsh_backward







'''simple docstring'''
import math






def A__					(  UpperCAmelCase_							):

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






def A__					(  UpperCAmelCase_ = 1_0_0_0						,						UpperCAmelCase_ = 1_0_0_0							):
						_UpperCamelCase      :	str				       =     [0, 0, 0]  # length, a, b
						for a in range((a_limit * -1) + 1						,						UpperCAmelCase_							):
												for b in range(2						,						UpperCAmelCase_							):
																		if is_prime(UpperCAmelCase_							):
																								_UpperCamelCase      :	List[str]				       =     0
																								_UpperCamelCase      :	Union[str, Any]				       =     0
																								while is_prime((n**2) + (a * n) + b							):
																														count += 1
																														n += 1
																								if count > longest[0]:
																														_UpperCamelCase      :	Any				       =     [count, a, b]
						_UpperCamelCase      :	Dict				       =     longest[1] * longest[2]
						return ans


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


