






'''simple docstring'''
def 		__SCREAMING_SNAKE_CASE       (	_UpperCamelCase    ,		_UpperCamelCase				):


   """simple docstring"""




   return abs(_UpperCamelCase				) if a == 0 else greatest_common_divisor(b % a    ,		_UpperCamelCase				)




def 		__SCREAMING_SNAKE_CASE       (	_UpperCamelCase    ,		_UpperCamelCase				):


   """simple docstring"""




   while y:  # --> when y=0 then loop will terminate and return x as final GCD.
      lowercase_						:     Dict							     =  y, x % y
   return abs(_UpperCamelCase				)




def 		__SCREAMING_SNAKE_CASE       (	):


   """simple docstring"""




   try:
      lowercase_						:     Optional[int]							     =  input("Enter two integers separated by comma (,): "				).split(","				)
      lowercase_						:     Any							     =  int(nums[0]				)
      lowercase_						:     str							     =  int(nums[1]				)
      print(
          F"""greatest_common_divisor({num_a}, {num_a}) = """
          F"""{greatest_common_divisor(_UpperCamelCase    ,		_UpperCamelCase				)}"""				)
      print(F"""By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(_UpperCamelCase    ,		_UpperCamelCase				)}"""				)
   except (IndexError, UnboundLocalError, ValueError):
      print("Wrong input"				)


if __name__ == "__main__":
 main()





from math import isqrt
def 		snake_case__	(		lowercase					):
   lowerCAmelCase_:							List[str]       =	[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					):
            lowerCAmelCase_:							Dict       =	False

   return [i for i in range(2							,				lowercase					) if is_prime[i]]
def 		snake_case__	(		lowercase = 10**8					):
   lowerCAmelCase_:							Union[str, Any]       =	calculate_prime_numbers(max_number // 2					)

   lowerCAmelCase_:							Tuple       =	0
   lowerCAmelCase_:							List[Any]       =	0
   lowerCAmelCase_:							Dict       =	len(lowercase					) - 1
   while left <= right:
      while prime_numbers[left] * prime_numbers[right] >= max_number:
         right -= 1
      semiprimes_count += right - left + 1
      left += 1

   return semiprimes_count


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