

"""simple docstring"""


def    a__   (   __SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)     ->     int:
		return x if y == 0 else greatest_common_divisor(__SCREAMING_SNAKE_CASE ,			x % y			)






def    a__   (   __SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)     ->     int:
		return (x * y) // greatest_common_divisor(__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)






def    a__   (   __SCREAMING_SNAKE_CASE = 2_0			)     ->     int:
		__lowerCAmelCase:	List[str]   				=      1
		for i in range(1 ,			n + 1			):
				__lowerCAmelCase:	List[str]   				=      lcm(__SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)
		return g


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





"""simple docstring"""


def    a__   (   __SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)     ->     int:
		return int((input_a, input_a).count(0			) == 0			)






def    a__   (   )     ->     None:
		assert and_gate(0 ,			0			) == 0
		assert and_gate(0 ,			1			) == 0
		assert and_gate(1 ,			0			) == 0
		assert and_gate(1 ,			1			) == 1


if __name__ == "__main__":
			test_and_gate()
			print(and_gate(1, 0))
			print(and_gate(0, 0))
			print(and_gate(0, 1))
			print(and_gate(1, 1))


