



def 			lowerCAmelCase__	(					lowerCamelCase_	:	int ,lowerCamelCase_	:	int):





				'''simple docstring'''

				return x if y == 0 else greatest_common_divisor(lowerCamelCase_ ,x % y)






def 			lowerCAmelCase__	(					lowerCamelCase_	:	int ,lowerCamelCase_	:	int):





				'''simple docstring'''

				return (x * y) // greatest_common_divisor(lowerCamelCase_ ,lowerCamelCase_)






def 			lowerCAmelCase__	(					lowerCamelCase_	:	int = 20):





				'''simple docstring'''

				lowerCAmelCase__  :       Any				=  1
				for i in range(1 ,n + 1):
								lowerCAmelCase__  :       List[Any]				=  lcm(lowerCamelCase_ ,lowerCamelCase_)
				return g


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






from __future__ import annotations






def 			lowerCAmelCase__	(					lowerCamelCase_	:	int):





				'''simple docstring'''

				lowerCAmelCase__  :       Optional[int]				=  str(lowerCamelCase_)
				return len(lowerCamelCase_) == 9 and set(lowerCamelCase_) == set('''123456789''')






def 			lowerCAmelCase__	(					):





				'''simple docstring'''

				for base_num in range(9999 ,4999 ,-1):
								lowerCAmelCase__  :       Union[str, Any]				=  100002 * base_num
								if is_9_pandigital(lowerCamelCase_):
												return candidate

				for base_num in range(333 ,99 ,-1):
								lowerCAmelCase__  :       Any				=  1002003 * base_num
								if is_9_pandigital(lowerCamelCase_):
												return candidate

				return None


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

