
'''simple docstring'''






from math import sqrt







def 		A_							(						_lowerCAmelCase :     int				):



      """simple docstring"""




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

      _lowerCamelCase					: Tuple		    = True

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

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

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

      return status







def 		A_							(						_lowerCAmelCase :     Optional[Any]				):



      """simple docstring"""




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

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

      _lowerCamelCase					: Dict		    = []  # this list will be returns.

      # actual sieve of erathostenes
      for i in range(len(_lowerCAmelCase				)				):
            for j in range(i + 1					,						len(_lowerCAmelCase				)				):
                  if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
                        _lowerCamelCase					: List[Any]		    = 0

    # filters actual prime numbers.
      _lowerCamelCase					: Any		    = [x for x in begin_list if x != 0]

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

      return ans







def 		A_							(						_lowerCAmelCase :     Union[str, Any]				):



      """simple docstring"""




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

      _lowerCamelCase					: Dict		    = []

      # 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(_lowerCAmelCase				):
                  ans.append(_lowerCAmelCase				)

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

      return ans







def 		A_							(						_lowerCAmelCase :     Any				):



      """simple docstring"""




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

      _lowerCamelCase					: Tuple		    = []  # this list will be returns of the function.

      # potential prime number factors.

      _lowerCamelCase					: Optional[Any]		    = 2

      _lowerCamelCase					: Optional[Any]		    = number

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

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

      else:
            ans.append(_lowerCAmelCase				)

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

      return ans







def 		A_							(						_lowerCAmelCase :     Union[str, Any]				):



      """simple docstring"""




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

      _lowerCamelCase					: Union[str, Any]		    = 0

      # prime factorization of 'number'
      _lowerCamelCase					: Tuple		    = prime_factorization(_lowerCAmelCase				)

      _lowerCamelCase					: int		    = max(_lowerCAmelCase				)

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

      return ans







def 		A_							(						_lowerCAmelCase :     Union[str, Any]				):



      """simple docstring"""




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

      _lowerCamelCase					: int		    = 0

      # prime factorization of 'number'
      _lowerCamelCase					: List[Any]		    = prime_factorization(_lowerCAmelCase				)

      _lowerCamelCase					: Any		    = min(_lowerCAmelCase				)

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

      return ans







def 		A_							(						_lowerCAmelCase :     Optional[Any]				):



      """simple docstring"""




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

      return number % 2 == 0







def 		A_							(						_lowerCAmelCase :     Any				):



      """simple docstring"""




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

      return number % 2 != 0







def 		A_							(						_lowerCAmelCase :     Union[str, Any]				):



      """simple docstring"""




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

      _lowerCamelCase					: int		    = []  # this list will returned

      # creates a list of prime numbers between 2 up to 'number'
      _lowerCamelCase					: Any		    = get_prime_numbers(_lowerCAmelCase				)
      _lowerCamelCase					: Optional[int]		    = len(_lowerCAmelCase				)

      # run variable for while-loops.
      _lowerCamelCase					: List[str]		    = 0
      _lowerCamelCase					: str		    = None

      # exit variable. for break up the loops
      _lowerCamelCase					: List[Any]		    = True

      while i < len_pn and loop:
            _lowerCamelCase					: List[Any]		    = i + 1

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

                  j += 1

            i += 1

      # precondition
      assert (
          isinstance(_lowerCAmelCase					,						_lowerCAmelCase				)
          and (len(_lowerCAmelCase				) == 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 		A_							(						_lowerCAmelCase :     Dict					,						_lowerCAmelCase :     Tuple				):



      """simple docstring"""




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

      _lowerCamelCase					: Optional[int]		    = 0

      while numbera != 0:
            _lowerCamelCase					: Tuple		    = numbera % numbera
            _lowerCamelCase					: List[Any]		    = numbera
            _lowerCamelCase					: str		    = rest

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

      return numbera







def 		A_							(						_lowerCAmelCase :     Optional[int]					,						_lowerCAmelCase :     Tuple				):



      """simple docstring"""




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

      _lowerCamelCase					: 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'
            _lowerCamelCase					: Optional[int]		    = prime_factorization(_lowerCAmelCase				)
            _lowerCamelCase					: Optional[Any]		    = prime_factorization(_lowerCAmelCase				)

      elif numbera == 1 or numbera == 1:
            _lowerCamelCase					: List[str]		    = []
            _lowerCamelCase					: Any		    = []
            _lowerCamelCase					: Dict		    = max(_lowerCAmelCase					,						_lowerCAmelCase				)

      _lowerCamelCase					: Dict		    = 0
      _lowerCamelCase					: Optional[Any]		    = 0

      _lowerCamelCase					: Optional[Any]		    = []  # 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:
                        _lowerCamelCase					: Any		    = prime_fac_a.count(_lowerCAmelCase				)
                        _lowerCamelCase					: int		    = prime_fac_a.count(_lowerCAmelCase				)

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

                  else:
                        _lowerCamelCase					: str		    = prime_fac_a.count(_lowerCAmelCase				)

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

                  done.append(_lowerCAmelCase				)

    # iterates through primeFac2
      for n in prime_fac_a:
            if n not in done:
                  _lowerCamelCase					: Optional[Any]		    = prime_fac_a.count(_lowerCAmelCase				)

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

                  done.append(_lowerCAmelCase				)

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

      return ans







def 		A_							(						_lowerCAmelCase :     Any				):



      """simple docstring"""




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

      _lowerCamelCase					: int		    = 0
      _lowerCamelCase					: Dict		    = 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(_lowerCAmelCase				):
                  ans += 1

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

      return ans







def 		A_							(						_lowerCAmelCase :     Any					,						_lowerCAmelCase :     Any				):



      """simple docstring"""




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

      _lowerCamelCase					: Any		    = p_number_a + 1  # jump to the next number

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

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

      while number < p_number_a:
            ans.append(_lowerCAmelCase				)

            number += 1

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

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

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







def 		A_							(						_lowerCAmelCase :     Union[str, Any]				):



      """simple docstring"""




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

      _lowerCamelCase					: int		    = []  # will be returned.

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

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

      return ans







def 		A_							(						_lowerCAmelCase :     List[str]				):



      """simple docstring"""




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

      _lowerCamelCase					: Union[str, Any]		    = get_divisors(_lowerCAmelCase				)

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

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







def 		A_							(						_lowerCAmelCase :     List[str]					,						_lowerCAmelCase :     Optional[int]				):



      """simple docstring"""




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

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

      # precondition
      assert (
          isinstance(_lowerCAmelCase					,						_lowerCAmelCase				)
          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 		A_							(						_lowerCAmelCase :     List[str]				):



      """simple docstring"""




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

      _lowerCamelCase					: Dict		    = 1  # this will be return.

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

      return ans







def 		A_							(						_lowerCAmelCase :     List[Any]				):



      """simple docstring"""




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

      _lowerCamelCase					: int		    = 0
      _lowerCamelCase					: str		    = 1
      _lowerCamelCase					: Tuple		    = 1  # this will be return

      for _ in range(n - 1				):
            _lowerCamelCase					: str		    = ans
            ans += fiba
            _lowerCamelCase					: Dict		    = tmp

      return ans







from ...configuration_utils import PretrainedConfig
from ...utils import logging
from ...utils.backbone_utils import BackboneConfigMixin, get_aligned_output_features_output_indices


lowerCamelCase__       		=  logging.get_logger(__name__)

lowerCamelCase__       		=  {
    """microsoft/focalnet-tiny""": """https://huggingface.co/microsoft/focalnet-tiny/resolve/main/config.json""",
}




class       snake_case__ (				lowercase_						,     lowercase_):

       '''simple docstring'''
       lowerCamelCase				:					List[Any]								=			"focalnet"



       def __init__(				self      ,    a__=2_24      ,    a__=4      ,    a__=3      ,    a__=96      ,    a__=False      ,    a__=[1_92, 3_84, 7_68, 7_68]      ,    a__=[2, 2, 6, 2]      ,    a__=[2, 2, 2, 2]      ,    a__=[3, 3, 3, 3]      ,    a__="gelu"      ,    a__=4.0      ,    a__=0.0      ,    a__=0.1      ,    a__=False      ,    a__=1e-4      ,    a__=False      ,    a__=False      ,    a__=False      ,    a__=0.02      ,    a__=1e-5      ,    a__=32      ,    a__=None      ,    a__=None      ,    **a__      ,    )			->   Tuple:






            '''simple docstring'''





            super().__init__(**a__     )

            __snake_case      :Optional[Any] 							=    image_size
            __snake_case      :Dict 							=    patch_size
            __snake_case      :Tuple 							=    num_channels
            __snake_case      :List[str] 							=    embed_dim
            __snake_case      :Any 							=    use_conv_embed
            __snake_case      :List[Any] 							=    hidden_sizes
            __snake_case      :str 							=    depths
            __snake_case      :List[Any] 							=    focal_levels
            __snake_case      :int 							=    focal_windows
            __snake_case      :Any 							=    hidden_act
            __snake_case      :List[str] 							=    mlp_ratio
            __snake_case      :str 							=    hidden_dropout_prob
            __snake_case      :List[str] 							=    drop_path_rate
            __snake_case      :int 							=    use_layerscale
            __snake_case      :int 							=    layerscale_value
            __snake_case      :Tuple 							=    use_post_layernorm
            __snake_case      :Dict 							=    use_post_layernorm_in_modulation
            __snake_case      :Union[str, Any] 							=    normalize_modulator
            __snake_case      :List[str] 							=    initializer_range
            __snake_case      :Optional[Any] 							=    layer_norm_eps
            __snake_case      :Tuple 							=    encoder_stride
            __snake_case      :List[str] 							=    ["""stem"""] + [F'''stage{idx}''' for idx in range(1      ,    len(self.depths     ) + 1     )]
            __snake_case							,			__snake_case      :str 							=    get_aligned_output_features_output_indices(
                out_features=a__      ,    out_indices=a__      ,    stage_names=self.stage_names     )


