






'''simple docstring'''

def __snake_case      (   UpperCAmelCase_		:		int	):
 lowerCamelCase_  				=						int(UpperCAmelCase_	)
 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_						:       List[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""")
     a_						:       Tuple      			=				hamming(int(n))
     print("""-----------------------------------------------------""")
     print(f'''The list with nth numbers is: {hamming_numbers}''')
     print("""-----------------------------------------------------""")







'''simple docstring'''

def __snake_case      (   UpperCAmelCase_		:		int      ,       UpperCAmelCase_		:		int	):
 return "\n".join(
     F'''{number} * {i} = {number * i}''' for i in range(1      ,       number_of_terms + 1	)	)


if __name__ == "__main__":
     print(multiplication_table(number=5, number_of_terms=10))



