




def 							_UpperCAmelCase  (UpperCamelCase_ : Union[str, Any]       ):
				'''simple docstring'''
				_lowerCAmelCase    :    str										=      len(UpperCamelCase_       )
				_lowerCAmelCase    :    Union[str, Any]										=      sum(UpperCamelCase_       )

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

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

				for i in range(1      ,    s + 1       ):
								_lowerCAmelCase    :    Union[str, Any]										=      False

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

												if arr[i - 1] <= j:
																_lowerCAmelCase    :    List[str]										=      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    :    Optional[Any]										=      s - 2 * j
												break

				return diff







from math import loga




def 							_UpperCAmelCase  (UpperCamelCase_ : int       ):
				'''simple docstring'''
				if a < 0:
								raise ValueError("""Input value must be a positive integer"""       )
				elif isinstance(UpperCamelCase_      ,    UpperCamelCase_       ):
								raise TypeError("""Input value must be a 'int' type"""       )
				return 0 if (a == 0) else int(loga(a & -a       )       )


if __name__ == "__main__":
	import doctest

	doctest.testmod()

