

'''simple docstring'''
def        _lowerCAmelCase					(						_UpperCamelCase						:     str							, _UpperCamelCase						:     int				)      ->			list[str]:
     """simple docstring"""




     return [sentence[i : i + ngram_size] for i in range(len(_UpperCamelCase				) - ngram_size + 1				)]


if __name__ == "__main__":
     from doctest import testmod

     testmod()





"""simple docstring"""
from math import isqrt, loga

def       _snake_case						(						UpperCamelCase						:		int						):
 UpperCAmelCase	:					Any	=	[True] * max_number
 for i in range(2			,		isqrt(max_number - 1						) + 1						):
  if is_prime[i]:
   for j in range(i**2			,		UpperCamelCase			,		UpperCamelCase						):
    UpperCAmelCase	:					str	=	False

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

def       _snake_case						(						UpperCamelCase						:		int = 800800			,		UpperCamelCase						:		int = 800800						):
 UpperCAmelCase	:					Union[str, Any]	=	degree * loga(UpperCamelCase						)
 UpperCAmelCase	:					int	=	int(UpperCamelCase						)
 UpperCAmelCase	:					Union[str, Any]	=	calculate_prime_numbers(UpperCamelCase						)

 UpperCAmelCase	:					Dict	=	0
 UpperCAmelCase	:					Optional[int]	=	0
 UpperCAmelCase	:					Dict	=	len(UpperCamelCase						) - 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() = }""")
