


'''simple docstring'''
def 			a      (			__a ,					__a   )  ->	int:



					'''simple docstring'''






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


def 			a      (			__a ,					__a   )  ->	int:



					'''simple docstring'''






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


def 			a      (			__a = 20   )  ->	int:



					'''simple docstring'''






					UpperCamelCase__   :Optional[Any]												= 1
					for i in range(1 ,					n + 1   ):
										UpperCamelCase__   :Tuple												= lcm(__a ,					__a   )
					return g


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



'''simple docstring'''
def 			a      (			)  ->	Union[str, Any]:



					'''simple docstring'''






					UpperCamelCase__   :Optional[int]												= []
					UpperCamelCase__   :int												= 1

					while len(__a   ) < 1e6:
										constant.append(str(__a   )   )
										i += 1

					UpperCamelCase__   :Union[str, Any]												= ''''''.join(__a   )

					return (
					    int(constant[0]   )
					    * int(constant[9]   )
					    * int(constant[99]   )
					    * int(constant[999]   )
					    * int(constant[9999]   )
					    * int(constant[99999]   )
					    * int(constant[999999]   )
					)


if __name__ == "__main__":
		print(solution())