





'''simple docstring'''


def 						__a(SCREAMING_SNAKE_CASE_	:       int		,							SCREAMING_SNAKE_CASE_	:       int     ):



    '''simple docstring'''





    if b == 0:
        return 1
    if (b % 2) == 0:
        return actual_power(SCREAMING_SNAKE_CASE_		,							int(b / 2     )     ) * actual_power(SCREAMING_SNAKE_CASE_		,							int(b / 2     )     )
    else:
        return a * actual_power(SCREAMING_SNAKE_CASE_		,							int(b / 2     )     ) * actual_power(SCREAMING_SNAKE_CASE_		,							int(b / 2     )     )


def 						__a(SCREAMING_SNAKE_CASE_	:       int		,							SCREAMING_SNAKE_CASE_	:       int     ):



    '''simple docstring'''





    if b < 0:
        return 1 / actual_power(SCREAMING_SNAKE_CASE_		,							SCREAMING_SNAKE_CASE_     )
    return actual_power(SCREAMING_SNAKE_CASE_		,							SCREAMING_SNAKE_CASE_     )


if __name__ == "__main__":
       print(power(-2, -3))










'''simple docstring'''







from math import isqrt, loga


def       __UpperCamelCase					(      lowercase_       :  int   ):
       """simple docstring"""




       a_						     =			[True] * max_number
       for i in range(2   ,       isqrt(max_number - 1   ) + 1   ):
              if is_prime[i]:
                     for j in range(i**2   ,       lowercase_   ,       lowercase_   ):
                            a_						     =			False

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


def       __UpperCamelCase					(      lowercase_       :  int = 800_800   ,       lowercase_       :  int = 800_800   ):
       """simple docstring"""




       a_						     =			degree * loga(lowercase_   )
       a_						     =			int(lowercase_   )
       a_						     =			calculate_prime_numbers(lowercase_   )

       a_						     =			0
       a_						     =			0
       a_						     =			len(lowercase_   ) - 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() = }""")




