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


_SCREAMING_SNAKE_CASE										=						logging.get_logger(__name__)

_SCREAMING_SNAKE_CASE										=						{
    'facebook/convnextv2-tiny-1k-224': 'https://huggingface.co/facebook/convnextv2-tiny-1k-224/resolve/main/config.json',
}



class 				a							(			__lowerCAmelCase       ,			__lowerCAmelCase       ):







 """simple docstring"""






 lowerCamelCase	:str    			=		'''convnextv2'''



 def __init__(					self		,				lowerCAmelCase_=3		,				lowerCAmelCase_=4		,				lowerCAmelCase_=4		,				lowerCAmelCase_=None		,				lowerCAmelCase_=None		,				lowerCAmelCase_="gelu"		,				lowerCAmelCase_=0.02		,				lowerCAmelCase_=1E-12		,				lowerCAmelCase_=0.0		,				lowerCAmelCase_=2_24		,				lowerCAmelCase_=None		,				lowerCAmelCase_=None		,				**lowerCAmelCase_		,				)  ->					Dict:
        super().__init__(**lowerCAmelCase_							)

        _A        =  num_channels
        _A        =  patch_size
        _A        =  num_stages
        _A        =  [96, 1_92, 3_84, 7_68] if hidden_sizes is None else hidden_sizes
        _A        =  [3, 3, 9, 3] if depths is None else depths
        _A        =  hidden_act
        _A        =  initializer_range
        _A        =  layer_norm_eps
        _A        =  drop_path_rate
        _A        =  image_size
        _A        =  ["""stem"""] + [F'''stage{idx}''' for idx in range(1		,				len(self.depths							) + 1							)]
        _A   ,  _A        =  get_aligned_output_features_output_indices(
            out_features=lowerCAmelCase_		,				out_indices=lowerCAmelCase_		,				stage_names=self.stage_names							)





from math import isqrt, loga






def  snake_case  (       snake_case__			:int)						->   list[int]:
       _A        =  [True] * max_number
       for i in range(2   ,	isqrt(max_number - 1) + 1):
              if is_prime[i]:
                     for j in range(i**2   ,	snake_case__   ,	snake_case__):
                            _A        =  False

       return [i for i in range(2   ,	snake_case__) if is_prime[i]]






def  snake_case  (       snake_case__			:int = 800_800   ,	snake_case__			:int = 800_800)						->   int:
       _A        =  degree * loga(snake_case__)
       _A        =  int(snake_case__)
       _A        =  calculate_prime_numbers(snake_case__)

       _A        =  0
       _A        =  0
       _A        =  len(snake_case__) - 1
       while left < right:
              while (
                  prime_numbers[right] * loga(prime_numbers[left])
                  + prime_numbers[left] * loga(prime_numbers[right])
                  > upper_bound
              ):
                     right -= 1
              hybrid_integers_count += right - left
              left += 1

       return hybrid_integers_count


if __name__ == "__main__":
    print(F'''{solution() = }''')




