






def 				snake_case  (     lowerCamelCase					):




	'''simple docstring'''







	__lowercase             =  len(lowerCamelCase					)
	__lowercase             =  sum(lowerCamelCase					)

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

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

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

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

			if arr[i - 1] <= j:
				__lowercase             =  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:
			__lowercase             =  s - 2 * j
			break

	return diff









from __future__ import annotations





def 				snake_case  (     lowerCamelCase					):




	'''simple docstring'''







	if not nums:
		return 0
	__lowercase             =  nums[0]
	__lowercase             =  0
	for num in nums[1:]:
		__lowercase       ,						__lowercase             =  (
		    max_excluding + num,
		    max(lowerCamelCase				,  lowerCamelCase					),
		)
	return max(lowerCamelCase				,  lowerCamelCase					)


if __name__ == "__main__":
						import doctest

						doctest.testmod()

