def 							lowerCAmelCase(     __lowerCamelCase						):
					__a		 =       len(__lowerCamelCase						)
					__a		 =       sum(__lowerCamelCase						)

					__a		 =       [[False for x in range(s + 1						)] for y in range(n + 1						)]

					for i in range(1				,    n + 1						):
										__a		 =       True

					for i in range(1				,    s + 1						):
										__a		 =       False

					for i in range(1				,    n + 1						):
										for j in range(1				,    s + 1						):
															__a		 =       dp[i][j - 1]

															if arr[i - 1] <= j:
																				__a		 =       dp[i][j] or dp[i - 1][j - arr[i - 1]]

					for j in range(int(s / 2						)				,    -1				,    -1						):
										if dp[n][j] is True:
															__a		 =       s - 2 * j
															break

					return diff





from __future__ import annotations

import numpy as np
def 							lowerCAmelCase(     __lowerCamelCase						):
					return np.maximum(0				,    __lowerCamelCase						)


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




