





def      A__       (    SCREAMING_SNAKE_CASE_   :      int				,	SCREAMING_SNAKE_CASE_   :      int						)  ->  str:






   """simple docstring"""







   if a < 0 or b < 0:
      raise ValueError('''the value of both inputs must be positive'''						)

   _UpperCAmelCase           =   str(bin(SCREAMING_SNAKE_CASE_						)						)[2:]  # remove the leading "0b"
   _UpperCAmelCase           =   str(bin(SCREAMING_SNAKE_CASE_						)						)[2:]  # remove the leading "0b"

   _UpperCAmelCase           =   max(len(SCREAMING_SNAKE_CASE_						)				,	len(SCREAMING_SNAKE_CASE_						)						)

   return "0b" + "".join(
       str(int(char_a == '''1''' and char_b == '''1'''						)						)
       for char_a, char_b in zip(a_binary.zfill(SCREAMING_SNAKE_CASE_						)				,	b_binary.zfill(SCREAMING_SNAKE_CASE_						)						)						)


if __name__ == "__main__":
   import doctest

   doctest.testmod()

from __future__ import annotations

import math





def      lowerCamelCase_					(							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


__A							=[num for num in range(3, 1_0_0_0_0_1, 2) if not is_prime(num)]





def      lowerCamelCase_					(							lowerCamelCase__       ):
				if not isinstance(lowerCamelCase__      ,					lowerCamelCase__       ):
								raise ValueError("n must be an integer"       )
				if n <= 0:
								raise ValueError("n must be >= 0"       )

				lowerCamelCase_         =     []
				for num in range(len(lowerCamelCase__       )       ):
								lowerCamelCase_         =     0
								while 2 * i * i <= odd_composites[num]:
												lowerCamelCase_         =     odd_composites[num] - 2 * i * i
												if is_prime(lowerCamelCase__       ):
																break
												i += 1
								else:
												list_nums.append(odd_composites[num]       )
												if len(lowerCamelCase__       ) == n:
																return list_nums

				return []





def      lowerCamelCase_					(							):
				return compute_nums(1       )[0]


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


