
"""simple docstring"""

def 							A						(    snake_case				:int    , snake_case				:int		)				->     str:
	if a < 0 or b < 0:
		raise ValueError('the value of both inputs must be positive'		)
	__UpperCamelCase      =	str(bin(snake_case		)		)[2:]  # remove the leading "0b"
	__UpperCamelCase      =	str(bin(snake_case		)		)[2:]
	__UpperCamelCase      =	max(len(snake_case		)    , len(snake_case		)		)
	return "0b" + "".join(
	    str(int('1' in (char_a, char_b)		)		)
	    for char_a, char_b in zip(a_binary.zfill(snake_case		)    , b_binary.zfill(snake_case		)		)		)


if __name__ == "__main__":
						import doctest

						doctest.testmod()





"""simple docstring"""

from math import factorial

UpperCamelCase     :    List[Any]       =			{str(d): factorial(d) for d in range(1_0)}






def 							A						(    snake_case				:int		)				->     int:
 return sum(DIGIT_FACTORIAL[d] for d in str(snake_case		)		)






def 							A						(    )				->     int:
 __UpperCamelCase      =	7 * factorial(9		) + 1
 return sum(i for i in range(3    , snake_case		) if sum_of_digit_factorial(snake_case		) == i		)


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



