


from math import isqrt, loga






def 							__lowercase       (			__lowerCAmelCase							:    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 ,   __lowerCAmelCase ,   __lowerCAmelCase       ):
																												a__					=					False

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






def 							__lowercase       (			__lowerCAmelCase							:    int = 8_0_0_8_0_0 ,   __lowerCAmelCase							:    int = 8_0_0_8_0_0       ):
							a__					=					degree * loga(__lowerCAmelCase       )
							a__					=					int(__lowerCAmelCase       )
							a__					=					calculate_prime_numbers(__lowerCAmelCase       )

							a__					=					0
							a__					=					0
							a__					=					len(__lowerCAmelCase       ) - 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() = }""")








from .configuration_bert_masked import MaskedBertConfig
from .modeling_bert_masked import (
    MaskedBertForMultipleChoice,
    MaskedBertForQuestionAnswering,
    MaskedBertForSequenceClassification,
    MaskedBertForTokenClassification,
    MaskedBertModel,
)
from .modules import *




