



def 				A				(					_lowerCamelCase  ):





							'''simple docstring'''




							_lowerCAmelCase     :							Dict    =    int(_lowerCamelCase  )
							if n_element < 1:
														_lowerCAmelCase     :							Tuple    =    ValueError("a should be a positive number"  )
														raise my_error

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








"""simple docstring"""



from __future__ import annotations

__A		:       List[Any]  				=		[-10, -5, 0, 5, 5.1, 11, 13, 21, 3, 4, -21, -10, -5, -1, 0]
__A		:       str  				=		[-5, 0, 5, 5.1, 11, 13, 21, -1, 4, -1, -10, -5, -1, 0, -1]



def 						lowercase    (				__snake_case				: list[float]	):
		lowercase_ : List[str]							       =   []
		lowercase_ : List[Any]							       =   len(__snake_case	)

		for i in range(__snake_case	):
				lowercase_ : float							       =   -1
				for j in range(i + 1		,					__snake_case	):
						if arr[i] < arr[j]:
								lowercase_ : List[str]							       =   arr[j]
								break
				result.append(__snake_case	)
		return result



def 						lowercase    (				__snake_case				: list[float]	):
		lowercase_ : List[str]							       =   []
		for i, outer in enumerate(__snake_case	):
				lowercase_ : float							       =   -1
				for inner in arr[i + 1 :]:
						if outer < inner:
								lowercase_ : List[Any]							       =   inner
								break
				result.append(__snake_case	)
		return result



def 						lowercase    (				__snake_case				: list[float]	):
		lowercase_ : List[str]							       =   len(__snake_case	)
		lowercase_ : list[float]							       =   []
		lowercase_ : list[float]							       =   [-1] * arr_size

		for index in reversed(range(__snake_case	)	):
				if stack:
						while stack[-1] <= arr[index]:
								stack.pop()
								if not stack:
										break
				if stack:
						lowercase_ : Optional[Any]							       =   stack[-1]
				stack.append(arr[index]	)
		return result


if __name__ == "__main__":
						from doctest import testmod
						from timeit import timeit

						testmod()
						print(next_greatest_element_slow(arr))
						print(next_greatest_element_fast(arr))
						print(next_greatest_element(arr))

						__A		:       int  				=		(
						    '''from __main__ import arr, next_greatest_element_slow, '''
						    '''next_greatest_element_fast, next_greatest_element'''
						)
						print(
						    '''next_greatest_element_slow():''',
						    timeit('''next_greatest_element_slow(arr)''', setup=setup),
						)
						print(
						    '''next_greatest_element_fast():''',
						    timeit('''next_greatest_element_fast(arr)''', setup=setup),
						)
						print(
						    '''     next_greatest_element():''',
						    timeit('''next_greatest_element(arr)''', setup=setup),
						)



