


from math import ceil
def        UpperCamelCase_(				_A   :int = 10_01  )->		int:
				UpperCamelCase__					=       1

				for i in range(1				,     int(ceil(n / 2.0  )  )  ):
								UpperCamelCase__					=       2 * i + 1
								UpperCamelCase__					=       2 * i
								UpperCamelCase__					=       total + 4 * odd**2 - 6 * even

				return total


if __name__ == "__main__":
						import sys

						if len(sys.argv) == 1:
												print(solution())
						else:
												try:
																		__UpperCamelCase    		=       int(sys.argv[1])
																		print(solution(n))
												except ValueError:
																		print('Invalid entry - please enter a number')






from __future__ import annotations

import numpy as np
def        UpperCamelCase_(				_A   :list[float]  )->		Union[str, Any]:
			return np.maximum(0				,     _A  )


if __name__ == "__main__":
						print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]


