


def 						_lowerCAmelCase							(     _lowerCAmelCase			)    ->						int:


						'''simple docstring'''






						__snake_case				=		[1]

						__snake_case		,       __snake_case		,       __snake_case				=		0, 0, 0
						__snake_case				=		ugly_nums[ia] * 2
						__snake_case				=		ugly_nums[ia] * 3
						__snake_case				=		ugly_nums[ia] * 5

						for _ in range(1   ,						_lowerCAmelCase			):
												__snake_case				=		min(_lowerCAmelCase   ,						_lowerCAmelCase   ,						_lowerCAmelCase			)
												ugly_nums.append(_lowerCAmelCase			)
												if next_num == next_a:
																		ia += 1
																		__snake_case				=		ugly_nums[ia] * 2
												if next_num == next_a:
																		ia += 1
																		__snake_case				=		ugly_nums[ia] * 3
												if next_num == next_a:
																		ia += 1
																		__snake_case				=		ugly_nums[ia] * 5
						return ugly_nums[-1]


if __name__ == "__main__":
	from doctest import testmod

	testmod(verbose=True)
	print(f'''{ugly_numbers(200) = }''')









def 						_lowerCAmelCase							(     _lowerCAmelCase = 100			)    ->						int:


						'''simple docstring'''






						__snake_case				=		n * (n + 1) * (2 * n + 1) / 6
						__snake_case				=		(n * (n + 1) / 2) ** 2
						return int(square_of_sum - sum_of_squares			)


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





