



'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						int					):






	'''simple docstring'''




	__lowerCAmelCase												=  int(lowerCamelCase					)
	if n_element < 1:
		__lowerCAmelCase												=  ValueError("a should be a positive number"					)
		raise my_error

	__lowerCAmelCase												=  [1]
	__lowerCAmelCase							,       __lowerCAmelCase							,       __lowerCAmelCase												=  (0, 0, 0)
	__lowerCAmelCase												=  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__":
	lowerCAmelCase	:		str				=   input('''Enter the last number (nth term) of the Hamming Number Series: ''')
	print('''Formula of Hamming Number Series => 2^i * 3^j * 5^k''')
	lowerCAmelCase	:		Optional[Any]				=   hamming(int(n))
	print('''-----------------------------------------------------''')
	print(f'The list with nth numbers is: {hamming_numbers}')
	print('''-----------------------------------------------------''')




'''simple docstring'''



def   __lowerCAmelCase					(							lowerCamelCase   :						Union[str, Any]					):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  2
	while i * i <= n:
		__lowerCAmelCase												=  0
		while n % i == 0:
			n //= i
			multiplicity += 1
		n_divisors *= multiplicity + 1
		i += 1
	if n > 1:
		n_divisors *= 2
	return n_divisors



def   __lowerCAmelCase					(							):






	'''simple docstring'''




	__lowerCAmelCase												=  1
	__lowerCAmelCase												=  1

	while True:
		i += 1
		t_num += i

		if count_divisors(lowerCamelCase					) > 5_00:
			break

	return t_num


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