
from math import sqrt






def   lowerCAmelCase_						(					_snake_case      :  int   )				->		bool:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (
	    number >= 0
	), "'number' must been an int and positive"

	__magic_name__		:		Union[str, Any]	   =     True

	# 0 and 1 are none primes.
	if number <= 1:
		__magic_name__		:		int	   =     False

	for divisor in range(2      ,   int(round(sqrt(_snake_case   )   )   ) + 1   ):
		# if 'number' divisible by 'divisor' then sets 'status'
		# of false and break up the loop.
		if number % divisor == 0:
			__magic_name__		:		int	   =     False
			break

    # precondition
	assert isinstance(_snake_case      ,   _snake_case   ), "'status' must been from type bool"

	return status






def   lowerCAmelCase_						(					_snake_case      :  List[str]   )				->		List[str]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (n > 2), "'N' must been an int and > 2"

	# beginList: contains all natural numbers from 2 up to N
	__magic_name__		:		Any	   =     list(range(2      ,   n + 1   )   )

	__magic_name__		:		Optional[int]	   =     []  # this list will be returns.

	# actual sieve of erathostenes
	for i in range(len(_snake_case   )   ):
		for j in range(i + 1      ,   len(_snake_case   )   ):
			if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
				__magic_name__		:		Union[str, Any]	   =     0

    # filters actual prime numbers.
	__magic_name__		:		List[str]	   =     [x for x in begin_list if x != 0]

	# precondition
	assert isinstance(_snake_case      ,   _snake_case   ), "'ans' must been from type list"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  Any   )				->		Optional[Any]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (n > 2), "'N' must been an int and > 2"

	__magic_name__		:		str	   =     []

	# iterates over all numbers between 2 up to N+1
	# if a number is prime then appends to list 'ans'
	for number in range(2      ,   n + 1   ):
		if is_prime(_snake_case   ):
			ans.append(_snake_case   )

    # precondition
	assert isinstance(_snake_case      ,   _snake_case   ), "'ans' must been from type list"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  str   )				->		int:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and number >= 0, "'number' must been an int and >= 0"

	__magic_name__		:		int	   =     []  # this list will be returns of the function.

	# potential prime number factors.

	__magic_name__		:		Dict	   =     2

	__magic_name__		:		int	   =     number

	if number == 0 or number == 1:
		ans.append(_snake_case   )

	# if 'number' not prime then builds the prime factorization of 'number'
	elif not is_prime(_snake_case   ):
		while quotient != 1:
			if is_prime(_snake_case   ) and (quotient % factor == 0):
				ans.append(_snake_case   )
				quotient /= factor
			else:
				factor += 1

	else:
		ans.append(_snake_case   )

	# precondition
	assert isinstance(_snake_case      ,   _snake_case   ), "'ans' must been from type list"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  Union[str, Any]   )				->		Optional[int]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (
	    number >= 0
	), "'number' bust been an int and >= 0"

	__magic_name__		:		List[str]	   =     0

	# prime factorization of 'number'
	__magic_name__		:		Dict	   =     prime_factorization(_snake_case   )

	__magic_name__		:		List[str]	   =     max(_snake_case   )

	# precondition
	assert isinstance(_snake_case      ,   _snake_case   ), "'ans' must been from type int"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  Optional[Any]   )				->		Optional[Any]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (
	    number >= 0
	), "'number' bust been an int and >= 0"

	__magic_name__		:		Any	   =     0

	# prime factorization of 'number'
	__magic_name__		:		List[str]	   =     prime_factorization(_snake_case   )

	__magic_name__		:		Optional[int]	   =     min(_snake_case   )

	# precondition
	assert isinstance(_snake_case      ,   _snake_case   ), "'ans' must been from type int"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  str   )				->		Any:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ), "'number' must been an int"
	assert isinstance(number % 2 == 0      ,   _snake_case   ), "compare bust been from type bool"

	return number % 2 == 0






def   lowerCAmelCase_						(					_snake_case      :  str   )				->		Dict:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ), "'number' must been an int"
	assert isinstance(number % 2 != 0      ,   _snake_case   ), "compare bust been from type bool"

	return number % 2 != 0






def   lowerCAmelCase_						(					_snake_case      :  Dict   )				->		List[str]:







	'''simple docstring'''


	assert (
	    isinstance(_snake_case      ,   _snake_case   ) and (number > 2) and is_even(_snake_case   )
	), "'number' must been an int, even and > 2"

	__magic_name__		:		Optional[Any]	   =     []  # this list will returned

	# creates a list of prime numbers between 2 up to 'number'
	__magic_name__		:		List[Any]	   =     get_prime_numbers(_snake_case   )
	__magic_name__		:		List[str]	   =     len(_snake_case   )

	# run variable for while-loops.
	__magic_name__		:		Dict	   =     0
	__magic_name__		:		Any	   =     None

	# exit variable. for break up the loops
	__magic_name__		:		Tuple	   =     True

	while i < len_pn and loop:
		__magic_name__		:		Optional[Any]	   =     i + 1

		while j < len_pn and loop:
			if prime_numbers[i] + prime_numbers[j] == number:
				__magic_name__		:		int	   =     False
				ans.append(prime_numbers[i]   )
				ans.append(prime_numbers[j]   )

			j += 1

		i += 1

	# precondition
	assert (
	    isinstance(_snake_case      ,   _snake_case   )
	    and (len(_snake_case   ) == 2)
	    and (ans[0] + ans[1] == number)
	    and is_prime(ans[0]   )
	    and is_prime(ans[1]   )
	), "'ans' must contains two primes. And sum of elements must been eq 'number'"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  int      ,   _snake_case      :  Optional[Any]   )				->		List[Any]:







	'''simple docstring'''


	assert (
	    isinstance(_snake_case      ,   _snake_case   )
	    and isinstance(_snake_case      ,   _snake_case   )
	    and (numbera >= 0)
	    and (numbera >= 0)
	), "'number1' and 'number2' must been positive integer."

	__magic_name__		:		str	   =     0

	while numbera != 0:
		__magic_name__		:		str	   =     numbera % numbera
		__magic_name__		:		str	   =     numbera
		__magic_name__		:		Union[str, Any]	   =     rest

	# precondition
	assert isinstance(_snake_case      ,   _snake_case   ) and (
	    numbera >= 0
	), "'number' must been from type int and positive"

	return numbera






def   lowerCAmelCase_						(					_snake_case      :  Dict      ,   _snake_case      :  List[str]   )				->		int:







	'''simple docstring'''


	assert (
	    isinstance(_snake_case      ,   _snake_case   )
	    and isinstance(_snake_case      ,   _snake_case   )
	    and (numbera >= 1)
	    and (numbera >= 1)
	), "'number1' and 'number2' must been positive integer."

	__magic_name__		:		int	   =     1  # actual answer that will be return.

	# for kgV (x,1)
	if numbera > 1 and numbera > 1:
		# builds the prime factorization of 'number1' and 'number2'
		__magic_name__		:		str	   =     prime_factorization(_snake_case   )
		__magic_name__		:		Union[str, Any]	   =     prime_factorization(_snake_case   )

	elif numbera == 1 or numbera == 1:
		__magic_name__		:		Optional[int]	   =     []
		__magic_name__		:		Optional[Any]	   =     []
		__magic_name__		:		int	   =     max(_snake_case      ,   _snake_case   )

	__magic_name__		:		str	   =     0
	__magic_name__		:		Optional[int]	   =     0

	__magic_name__		:		Tuple	   =     []  # captured numbers int both 'primeFac1' and 'primeFac2'

	# iterates through primeFac1
	for n in prime_fac_a:
		if n not in done:
			if n in prime_fac_a:
				__magic_name__		:		Any	   =     prime_fac_a.count(_snake_case   )
				__magic_name__		:		Dict	   =     prime_fac_a.count(_snake_case   )

				for _ in range(max(_snake_case      ,   _snake_case   )   ):
					ans *= n

			else:
				__magic_name__		:		Union[str, Any]	   =     prime_fac_a.count(_snake_case   )

				for _ in range(_snake_case   ):
					ans *= n

			done.append(_snake_case   )

    # iterates through primeFac2
	for n in prime_fac_a:
		if n not in done:
			__magic_name__		:		str	   =     prime_fac_a.count(_snake_case   )

			for _ in range(_snake_case   ):
				ans *= n

			done.append(_snake_case   )

    # precondition
	assert isinstance(_snake_case      ,   _snake_case   ) and (
	    ans >= 0
	), "'ans' must been from type int and positive"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  Optional[int]   )				->		List[str]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (n >= 0), "'number' must been a positive int"

	__magic_name__		:		int	   =     0
	__magic_name__		:		List[str]	   =     2  # this variable holds the answer

	while index < n:
		index += 1

		ans += 1  # counts to the next number

		# if ans not prime then
		# runs to the next prime number.
		while not is_prime(_snake_case   ):
			ans += 1

    # precondition
	assert isinstance(_snake_case      ,   _snake_case   ) and is_prime(
	    _snake_case   ), "'ans' must been a prime number and from type int"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  Any      ,   _snake_case      :  int   )				->		Any:







	'''simple docstring'''


	assert (
	    is_prime(_snake_case   ) and is_prime(_snake_case   ) and (p_number_a < p_number_a)
	), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

	__magic_name__		:		Tuple	   =     p_number_a + 1  # jump to the next number

	__magic_name__		:		List[Any]	   =     []  # this list will be returns.

	# if number is not prime then
	# fetch the next prime number.
	while not is_prime(_snake_case   ):
		number += 1

	while number < p_number_a:
		ans.append(_snake_case   )

		number += 1

		# fetch the next prime number.
		while not is_prime(_snake_case   ):
			number += 1

    # precondition
	assert (
	    isinstance(_snake_case      ,   _snake_case   )
	    and ans[0] != p_number_a
	    and ans[len(_snake_case   ) - 1] != p_number_a
	), "'ans' must been a list without the arguments"

	# 'ans' contains not 'pNumber1' and 'pNumber2' !
	return ans






def   lowerCAmelCase_						(					_snake_case      :  str   )				->		Optional[int]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (n >= 1), "'n' must been int and >= 1"

	__magic_name__		:		Any	   =     []  # will be returned.

	for divisor in range(1      ,   n + 1   ):
		if n % divisor == 0:
			ans.append(_snake_case   )

    # precondition
	assert ans[0] == 1 and ans[len(_snake_case   ) - 1] == n, "Error in function getDivisiors(...)"

	return ans






def   lowerCAmelCase_						(					_snake_case      :  Tuple   )				->		Optional[Any]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (
	    number > 1
	), "'number' must been an int and >= 1"

	__magic_name__		:		int	   =     get_divisors(_snake_case   )

	# precondition
	assert (
	    isinstance(_snake_case      ,   _snake_case   )
	    and (divisors[0] == 1)
	    and (divisors[len(_snake_case   ) - 1] == number)
	), "Error in help-function getDivisiors(...)"

	# summed all divisors up to 'number' (exclusive), hence [:-1]
	return sum(divisors[:-1]   ) == number






def   lowerCAmelCase_						(					_snake_case      :  str      ,   _snake_case      :  str   )				->		str:







	'''simple docstring'''


	assert (
	    isinstance(_snake_case      ,   _snake_case   )
	    and isinstance(_snake_case      ,   _snake_case   )
	    and (denominator != 0)
	), "The arguments must been from type int and 'denominator' != 0"

	# build the greatest common divisor of numerator and denominator.
	__magic_name__		:		Any	   =     gcd(abs(_snake_case   )      ,   abs(_snake_case   )   )

	# precondition
	assert (
	    isinstance(_snake_case      ,   _snake_case   )
	    and (numerator % gcd_of_fraction == 0)
	    and (denominator % gcd_of_fraction == 0)
	), "Error in function gcd(...,...)"

	return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)






def   lowerCAmelCase_						(					_snake_case      :  Dict   )				->		List[str]:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (n >= 0), "'n' must been a int and >= 0"

	__magic_name__		:		int	   =     1  # this will be return.

	for factor in range(1      ,   n + 1   ):
		ans *= factor

	return ans






def   lowerCAmelCase_						(					_snake_case      :  List[str]   )				->		Dict:







	'''simple docstring'''


	assert isinstance(_snake_case      ,   _snake_case   ) and (n >= 0), "'n' must been an int and >= 0"

	__magic_name__		:		Dict	   =     0
	__magic_name__		:		str	   =     1
	__magic_name__		:		List[Any]	   =     1  # this will be return

	for _ in range(n - 1   ):
		__magic_name__		:		Optional[Any]	   =     ans
		ans += fiba
		__magic_name__		:		Dict	   =     tmp

	return ans


from collections import OrderedDict
from typing import Mapping

from ...configuration_utils import PretrainedConfig
from ...onnx import OnnxConfig
from ...utils import logging


snake_case :		Dict							      =  logging.get_logger(__name__)

snake_case :		List[Any]							      =  {
    "YituTech/conv-bert-base": "https://huggingface.co/YituTech/conv-bert-base/resolve/main/config.json",
    "YituTech/conv-bert-medium-small": (
        "https://huggingface.co/YituTech/conv-bert-medium-small/resolve/main/config.json"
    ),
    "YituTech/conv-bert-small": "https://huggingface.co/YituTech/conv-bert-small/resolve/main/config.json",
    # See all ConvBERT models at https://huggingface.co/models?filter=convbert
}





class       _snake_case					(     snake_case				):
			UpperCamelCase__          =    'convbert'







			def __init__(				self						,   _a=30_522						,   _a=768						,   _a=12						,   _a=12						,   _a=3_072						,   _a="gelu"						,   _a=0.1						,   _a=0.1						,   _a=512						,   _a=2						,   _a=0.02						,   _a=1e-12						,   _a=1						,   _a=0						,   _a=2						,   _a=768						,   _a=2						,   _a=9						,   _a=1						,   _a=None						,   **_a						,   ):
				super().__init__(
				    pad_token_id=_a						,   bos_token_id=_a						,   eos_token_id=_a						,   **_a						,   )

				__magic_name__		:		Tuple	   =     vocab_size
				__magic_name__		:		List[Any]	   =     hidden_size
				__magic_name__		:		Union[str, Any]	   =     num_hidden_layers
				__magic_name__		:		List[Any]	   =     num_attention_heads
				__magic_name__		:		str	   =     intermediate_size
				__magic_name__		:		Any	   =     hidden_act
				__magic_name__		:		List[Any]	   =     hidden_dropout_prob
				__magic_name__		:		Optional[int]	   =     attention_probs_dropout_prob
				__magic_name__		:		Tuple	   =     max_position_embeddings
				__magic_name__		:		str	   =     type_vocab_size
				__magic_name__		:		List[str]	   =     initializer_range
				__magic_name__		:		Tuple	   =     layer_norm_eps
				__magic_name__		:		List[Any]	   =     embedding_size
				__magic_name__		:		List[Any]	   =     head_ratio
				__magic_name__		:		str	   =     conv_kernel_size
				__magic_name__		:		Dict	   =     num_groups
				__magic_name__		:		str	   =     classifier_dropout







class       _snake_case					(     snake_case				):







			@property
			def 			SCREAMING_SNAKE_CASE    (				self		):
				if self.task == "multiple-choice":
					__magic_name__		:		Dict	   =     {0: "batch", 1: "choice", 2: "sequence"}
				else:
					__magic_name__		:		Dict	   =     {0: "batch", 1: "sequence"}
				return OrderedDict(
				    [
				        ("input_ids", dynamic_axis),
				        ("attention_mask", dynamic_axis),
				        ("token_type_ids", dynamic_axis),
				    ]		)
