



def 		_UpperCAmelCase				(      snake_case	,						snake_case			):





					"""simple docstring"""

					while second != 0:
										_lowerCAmelCase						=    first & second
										first ^= second
										_lowerCAmelCase						=    c << 1
					return first


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	A__	      =       int(input("""Enter the first number: """).strip())
	A__	      =       int(input("""Enter the second number: """).strip())
	print(f"{add(first, second) = }")




from math import isqrt






def  snake_case  (       snake_case__			:int)						->   bool:
       return all(number % divisor != 0 for divisor in range(2   ,	isqrt(snake_case__) + 1))






def  snake_case  (       snake_case__			:int = 10**6)						->   int:
       _A        =  0
       _A        =  1
       _A        =  7
       while prime_candidate < max_prime:
              primes_count += is_prime(snake_case__)

              cube_index += 1
              prime_candidate += 6 * cube_index

       return primes_count


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




