



from math import factorial







def snake_case__  (			__SCREAMING_SNAKE_CASE = 20 )		->							int:
		UpperCAmelCase_						=				2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
		# 2, 3,...
		UpperCAmelCase_						=				n // 2

		return int(factorial(__SCREAMING_SNAKE_CASE ) / (factorial(__SCREAMING_SNAKE_CASE ) * factorial(n - k )) )


if __name__ == "__main__":
			import sys

			if len(sys.argv) == 1:
						print(solution(20))
			else:
						try:
									SCREAMING_SNAKE_CASE     				=						int(sys.argv[1])
									print(solution(n))
						except ValueError:
									print("Invalid entry - please enter a number.")






def snake_case__  (			__SCREAMING_SNAKE_CASE )		->							int:
		UpperCAmelCase_						=				[1]

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

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


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

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

