"""simple docstring"""




def 				_UpperCAmelCase		(							lowerCamelCase__      ,	lowerCamelCase__  ):





		"""simple docstring"""




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

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

		lowerCAmelCase__   = max(len(lowerCamelCase__  )      ,	len(lowerCamelCase__  )  )

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


if __name__ == "__main__":
			import doctest

			doctest.testmod()





"""simple docstring"""




from itertools import permutations







def 				_UpperCAmelCase		(							lowerCamelCase__  ):





		"""simple docstring"""




		if num[3] % 2 != 0:
				return False

		if (num[2] + num[3] + num[4]) % 3 != 0:
				return False

		if num[5] % 5 != 0:
				return False

		lowerCAmelCase__   = [7, 11, 13, 17]
		for i, test in enumerate(lowerCamelCase__  ):
				if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
						return False
		return True







def 				_UpperCAmelCase		(							lowerCamelCase__ = 10  ):





		"""simple docstring"""




		return sum(
		    int("""""".join(map(lowerCamelCase__      ,	lowerCamelCase__  )  )  )
		    for num in permutations(range(lowerCamelCase__  )  )
		    if is_substring_divisible(lowerCamelCase__  )  )


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




