






'''simple docstring'''
def 	_a(					UpperCamelCase__			:  int,		UpperCamelCase__			:  int							):




      '''simple docstring'''






      return number | (1 << position)





def 	_a(					UpperCamelCase__			:  int,		UpperCamelCase__			:  int							):




      '''simple docstring'''






      return number & ~(1 << position)





def 	_a(					UpperCamelCase__			:  int,		UpperCamelCase__			:  int							):




      '''simple docstring'''






      return number ^ (1 << position)





def 	_a(					UpperCamelCase__			:  int,		UpperCamelCase__			:  int							):




      '''simple docstring'''






      return ((number >> position) & 1) == 1





def 	_a(					UpperCamelCase__			:  int,		UpperCamelCase__			:  int							):




      '''simple docstring'''






      return int((number & (1 << position)) != 0							)


if __name__ == "__main__":
  import doctest

  doctest.testmod()







'''simple docstring'''
def 	_a(					UpperCamelCase__			:  Optional[Any]=2_8_1_2_3							):




      '''simple docstring'''






      SCREAMING_SNAKE_CASE__       :			List[Any]													=[1] * (limit + 1)

      for i in range(2,		int(limit**0.5							) + 1							):
            sum_divs[i * i] += i
            for k in range(i + 1,		limit // i + 1							):
                  sum_divs[k * i] += k + i

      SCREAMING_SNAKE_CASE__       :			List[str]													=set()
      SCREAMING_SNAKE_CASE__       :			str													=0

      for n in range(1,		limit + 1							):
            if sum_divs[n] > n:
                  abundants.add(UpperCamelCase__							)

            if not any((n - a in abundants) for a in abundants							):
                  res += n

      return res


if __name__ == "__main__":
  print(solution())