
import logging

from transformers import PretrainedConfig


_snake_case      :							Union[str, Any]     	=    logging.getLogger(__name__)


_snake_case      :							List[str]     	=    {
    "bertabs-finetuned-cnndm": "https://huggingface.co/remi/bertabs-finetuned-cnndm-extractive-abstractive-summarization/resolve/main/config.json",
}





class   UpperCamelCase_      (      __a		):







						'''simple docstring'''



						UpperCamelCase      :  List[Any]				   =					'''bertabs'''





						def __init__(			self							:str		,    lowerCAmelCase__							:Tuple=30522		,    lowerCAmelCase__							:List[Any]=512		,    lowerCAmelCase__							:List[Any]=6		,    lowerCAmelCase__							:str=512		,    lowerCAmelCase__							:Tuple=8		,    lowerCAmelCase__							:str=512		,    lowerCAmelCase__							:Tuple=0.2		,    lowerCAmelCase__							:Tuple=6		,    lowerCAmelCase__							:Optional[int]=768		,    lowerCAmelCase__							:Optional[int]=8		,    lowerCAmelCase__							:str=2048		,    lowerCAmelCase__							:Optional[Any]=0.2		,    **lowerCAmelCase__							:str		,    )  ->Dict:
										super().__init__(**lowerCAmelCase__     )

										lowercase         =      vocab_size
										lowercase         =      max_pos

										lowercase         =      enc_layers
										lowercase         =      enc_hidden_size
										lowercase         =      enc_heads
										lowercase         =      enc_ff_size
										lowercase         =      enc_dropout

										lowercase         =      dec_layers
										lowercase         =      dec_hidden_size
										lowercase         =      dec_heads
										lowercase         =      dec_ff_size
										lowercase         =      dec_dropout


def  __snake_case							(	__magic_name__		,    __magic_name__ = False						):







				'''simple docstring'''


				if n == 2:
								return True
				if not n % 2 or n < 2:
								return False
				if n > 5 and n % 10 not in (1, 3, 7, 9):  # can quickly check last digit
								return False
				if n > 3317044064679887385961981 and not allow_probable:
								raise ValueError(
								    "Warning: upper bound of deterministic test is exceeded. "
								    "Pass allow_probable=True to allow probabilistic test. "
								    "A return value of True indicates a probable prime."						)
				# array bounds provided by analysis
				lowercase         =      [
				    2047,
				    1373653,
				    25326001,
				    3215031751,
				    2152302898747,
				    3474749660383,
				    341550071728321,
				    1,
				    3825123056546413051,
				    1,
				    1,
				    318665857834031151167461,
				    3317044064679887385961981,
				]

				lowercase         =      [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41]
				for idx, _p in enumerate(__magic_name__		,    1						):
								if n < _p:
												# then we have our last prime to check
												lowercase         =      primes[:idx]
												break
				lowercase     ,	lowercase         =      n - 1, 0
				# break up n -1 into a power of 2 (s) and
				# remaining odd component
				# essentially, solve for d * 2 ** s == n - 1
				while d % 2 == 0:
								d //= 2
								s += 1
				for prime in plist:
								lowercase         =      False
								for r in range(__magic_name__						):
												lowercase         =      pow(__magic_name__		,    d * 2**r		,    __magic_name__						)
												# see article for analysis explanation for m
												if (r == 0 and m == 1) or ((m + 1) % n == 0):
																lowercase         =      True
																# this loop will not determine compositeness
																break
								if pr:
												continue
								# if pr is False, then the above loop never evaluated to true,
								# and the n MUST be composite
								return False
				return True

def  __snake_case							(	):







				'''simple docstring'''


				assert not miller_rabin(561						)
				assert miller_rabin(563						)
				# 2047

				assert not miller_rabin(838201						)
				assert miller_rabin(838207						)
				# 1_373_653

				assert not miller_rabin(17316001						)
				assert miller_rabin(17316017						)
				# 25_326_001

				assert not miller_rabin(3078386641						)
				assert miller_rabin(3078386653						)
				# 3_215_031_751

				assert not miller_rabin(1713045574801						)
				assert miller_rabin(1713045574819						)
				# 2_152_302_898_747

				assert not miller_rabin(2779799728307						)
				assert miller_rabin(2779799728327						)
				# 3_474_749_660_383

				assert not miller_rabin(113850023909441						)
				assert miller_rabin(113850023909527						)
				# 341_550_071_728_321

				assert not miller_rabin(1275041018848804351						)
				assert miller_rabin(1275041018848804391						)
				# 3_825_123_056_546_413_051

				assert not miller_rabin(79666464458507787791867						)
				assert miller_rabin(79666464458507787791951						)
				# 318_665_857_834_031_151_167_461

				assert not miller_rabin(552840677446647897660333						)
				assert miller_rabin(552840677446647897660359						)
				# 3_317_044_064_679_887_385_961_981
				# upper limit for probabilistic test


if __name__ == "__main__":
						test_miller_rabin()
