
'''simple docstring'''






def    UpperCAmelCase							(  UpperCAmelCase__							:							Optional[Any]):
				lowerCamelCase					:			Optional[Any]									= len(UpperCAmelCase__)
				lowerCamelCase					:			List[str]									= sum(UpperCAmelCase__)

				lowerCamelCase					:			Dict									= [[False for x in range(s + 1)] for y in range(n + 1)]

				for i in range(1       ,							n + 1):
								lowerCamelCase					:			Optional[Any]									= True

				for i in range(1       ,							s + 1):
								lowerCamelCase					:			Optional[int]									= False

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

												if arr[i - 1] <= j:
																lowerCamelCase					:			Dict									= 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:
												lowerCamelCase					:			Union[str, Any]									= s - 2 * j
												break

				return diff


'''simple docstring'''






import numpy as np





def    UpperCAmelCase							(  UpperCAmelCase__							:							np.array):
				return 1 / (1 + np.exp(-vector))


if __name__ == "__main__":
					import doctest

					doctest.testmod()
