"""simple docstring"""
def 					UpperCamelCase					(       SCREAMING_SNAKE_CASE_						,	SCREAMING_SNAKE_CASE_ )      ->Optional[Any]:
    return number | (1 << position)



def 					UpperCamelCase					(       SCREAMING_SNAKE_CASE_						,	SCREAMING_SNAKE_CASE_ )      ->List[str]:
    return number & ~(1 << position)



def 					UpperCamelCase					(       SCREAMING_SNAKE_CASE_						,	SCREAMING_SNAKE_CASE_ )      ->str:
    return number ^ (1 << position)



def 					UpperCamelCase					(       SCREAMING_SNAKE_CASE_						,	SCREAMING_SNAKE_CASE_ )      ->List[str]:
    return ((number >> position) & 1) == 1



def 					UpperCamelCase					(       SCREAMING_SNAKE_CASE_						,	SCREAMING_SNAKE_CASE_ )      ->Tuple:
    return int((number & (1 << position)) != 0 )


if __name__ == "__main__":
  import doctest

  doctest.testmod()










def     a     (		lowerCamelCase_						,  lowerCamelCase_							):






				'''simple docstring'''
				lowercase__  					=     len(lowerCamelCase_							)
				lowercase__  					=     [[False] * (required_sum + 1) for _ in range(arr_len + 1							)]

				# for each arr value, a sum of zero(0) can be formed by not taking any element
				# hence True/1
				for i in range(arr_len + 1							):
								lowercase__  					=     True

				# sum is not zero and set is empty then false
				for i in range(1						,  required_sum + 1							):
								lowercase__  					=     False

				for i in range(1						,  arr_len + 1							):
								for j in range(1						,  required_sum + 1							):
												if arr[i - 1] > j:
																lowercase__  					=     subset[i - 1][j]
												if arr[i - 1] <= j:
																lowercase__  					=     subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

				return subset[arr_len][required_sum]


if __name__ == "__main__":
							import doctest

							doctest.testmod()




