
from functools import lru_cache






@lru_cache
def 	a_		(	__lowercase       :     int			)			->  int:
			if num < 0:
						raise ValueError('Number should not be negative.'			)

			return 1 if num in (0, 1) else num * factorial(num - 1			)


if __name__ == "__main__":
			import doctest

			doctest.testmod()

from __future__ import annotations

_lowerCamelCase	:    Optional[Any]          =      [-10, -5, 0, 5, 5.1, 11, 13, 21, 3, 4, -21, -10, -5, -1, 0]
_lowerCamelCase	:    Optional[int]          =      [-5, 0, 5, 5.1, 11, 13, 21, -1, 4, -1, -10, -5, -1, 0, -1]






def 	a_		(	__lowercase       :     list[float]			)			->  list[float]:
			_snake_case          =      []
			_snake_case          =      len(__lowercase			)

			for i in range(__lowercase			):
						_snake_case          =      -1
						for j in range(i + 1	, __lowercase			):
									if arr[i] < arr[j]:
												_snake_case          =      arr[j]
												break
						result.append(__lowercase			)
			return result






def 	a_		(	__lowercase       :     list[float]			)			->  list[float]:
			_snake_case          =      []
			for i, outer in enumerate(__lowercase			):
						_snake_case          =      -1
						for inner in arr[i + 1 :]:
									if outer < inner:
												_snake_case          =      inner
												break
						result.append(__lowercase			)
			return result






def 	a_		(	__lowercase       :     list[float]			)			->  list[float]:
			_snake_case          =      len(__lowercase			)
			_snake_case          =      []
			_snake_case          =      [-1] * arr_size

			for index in reversed(range(__lowercase			)			):
						if stack:
									while stack[-1] <= arr[index]:
												stack.pop()
												if not stack:
															break
						if stack:
									_snake_case          =      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))

			_lowerCamelCase	:    Union[str, Any]          =      (
			    '''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),
			)