

"""simple docstring"""




def 	UpperCAmelCase__   (				A__   )      ->      list:




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







"""simple docstring"""




import numpy as np



def 	UpperCAmelCase__   (				A__   )      ->      np.array:




   """simple docstring"""
   return 1 / (1 + np.exp(-vector   ))


if __name__ == "__main__":
     import doctest

     doctest.testmod()




