



def 		_UpperCAmelCase				(      snake_case			):





					"""simple docstring"""

					_lowerCAmelCase						=    int(snake_case			)
					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__":
	A__	      =       input("""Enter the last number (nth term) of the Hamming Number Series: """)
	print("""Formula of Hamming Number Series => 2^i * 3^j * 5^k""")
	A__	      =       hamming(int(n))
	print("""-----------------------------------------------------""")
	print(f"The list with nth numbers is: {hamming_numbers}")
	print("""-----------------------------------------------------""")







"""simple docstring"""



def   __lowerCAmelCase						(						)	->						Union[str, Any]:


    """simple docstring"""





    snake_case    :      Dict      					=    []
    snake_case    :      List[Any]      					=    1

    while len(lowercase ) < 1e6:
        constant.append(str(lowercase ) )
        i += 1

    snake_case    :      Tuple      					=    "".join(lowercase )

    return (
        int(constant[0] )
        * int(constant[9] )
        * int(constant[99] )
        * int(constant[999] )
        * int(constant[9999] )
        * int(constant[9_9999] )
        * int(constant[99_9999] )
    )


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





