

def 					_UpperCAmelCase				(						a__):

			'''simple docstring'''



			a_						:						Union[str, Any] 							= 0
			while num > 0:
						digit_sum += num % 1_0
						num //= 1_0
			return digit_sum


def 					_UpperCAmelCase				(						a__ = 1_0_0):

			'''simple docstring'''



			a_						:						int 							= 1
			a_						:						str 							= 2

			for i in range(2  ,	max_n + 1):
						a_						:						List[str] 							= pre_numerator
						a_						:						List[str] 							= 2 * i // 3 if i % 3 == 0 else 1
						a_						:						Union[str, Any] 							= cur_numerator
						a_						:						int 							= e_cont * pre_numerator + temp

			return sum_digits(a__)


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





def 					_UpperCAmelCase				(						a__  ,	a__):

			'''simple docstring'''



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


def 					_UpperCAmelCase				(						a__  ,	a__):

			'''simple docstring'''



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


def 					_UpperCAmelCase				(						a__ = 2_0):

			'''simple docstring'''



			a_						:						Any 							= 1
			for i in range(1  ,	n + 1):
						a_						:						Tuple 							= lcm(a__  ,	a__)
			return g


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


