






"""simple docstring"""





def   a    (     __UpperCAmelCase      :    int      ,   __UpperCAmelCase      :    int  )    ->							int:
						while second != 0:
												__magic_name__:	Union[str, Any]							=       first & second
												first ^= second
												__magic_name__:	List[str]							=       c << 1
						return first


if __name__ == "__main__":
							import doctest

							doctest.testmod()

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







import math




def  a   (lowerCAmelCase__   ):

   if 1 < number < 4:
      # 2 and 3 are primes
      return True
   elif number < 2 or number % 2 == 0 or number % 3 == 0:
      # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
      return False

   # All primes number are in format of 6k +/- 1
   for i in range(5		,				int(math.sqrt(lowerCAmelCase__   ) + 1   )		,				6   ):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True




def  a   (lowerCAmelCase__ = 10_001   ):

   try:
      __a					=  int(lowerCAmelCase__   )
   except (TypeError, ValueError):
      raise TypeError("""Parameter nth must be int or castable to int."""   ) from None
   if nth <= 0:
      raise ValueError("""Parameter nth must be greater than or equal to one."""   )
   __a					=  []
   __a					=  2
   while len(lowerCAmelCase__   ) < nth:
      if is_prime(lowerCAmelCase__   ):
         primes.append(lowerCAmelCase__   )
         num += 1
      else:
         num += 1
   return primes[len(lowerCAmelCase__   ) - 1]


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



