



"""simple docstring"""






def   snake_case__     (	__lowerCamelCase       :					int			):
			"""simple docstring"""
			lowerCamelCase__	:	List[str]				=int(__lowerCamelCase			)
			if n_element < 1:
						lowerCamelCase__	:	List[str]				=ValueError('''a should be a positive number'''			)
						raise my_error

			lowerCamelCase__	:	str				=[1]
			lowerCamelCase__			,     lowerCamelCase__			,     lowerCamelCase__	:	Union[str, Any]				=(0, 0, 0)
			lowerCamelCase__	:	Any				=1
			while index < n_element:
						while hamming_list[i] * 2 <= hamming_list[-1]:
									i += 1
						while hamming_list[j] * 3 <= hamming_list[-1]:
									j += 1
						while hamming_list[k] * 5 <= hamming_list[-1]:
									k += 1
						hamming_list.append(
						    min(hamming_list[i] * 2							,	hamming_list[j] * 3							,	hamming_list[k] * 5			)			)
						index += 1
			return hamming_list


if __name__ == "__main__":
		_lowercase				:				int   		=		input("Enter the last number (nth term) of the Hamming Number Series: ")
		print("Formula of Hamming Number Series => 2^i * 3^j * 5^k")
		_lowercase				:				List[str]   		=		hamming(int(n))
		print("-----------------------------------------------------")
		print(f'The list with nth numbers is: {hamming_numbers}')
		print("-----------------------------------------------------")









"""simple docstring"""






def   snake_case__     (	__lowerCamelCase       :					int = 4000000			):
			"""simple docstring"""
			lowerCamelCase__	:	Dict				=[]
			lowerCamelCase__			,     lowerCamelCase__	:	Union[str, Any]				=0, 1
			while b <= n:
						if b % 2 == 0:
									even_fibs.append(__lowerCamelCase			)
						lowerCamelCase__			,     lowerCamelCase__	:	Union[str, Any]				=b, a + b
			return sum(__lowerCamelCase			)


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




