

"""simple docstring"""


def    a__   (   __SCREAMING_SNAKE_CASE=2_8_1_2_3			)     ->     Dict:
		__lowerCAmelCase:	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

		__lowerCAmelCase:	Union[str, Any]   				=      set()
		__lowerCAmelCase:	Tuple   				=      0

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

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

		return res


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





"""simple docstring"""


def    a__   (   __SCREAMING_SNAKE_CASE ,			__SCREAMING_SNAKE_CASE			)     ->     int:
		return int((input_a, input_a).count(0			) == 0			)






def    a__   (   )     ->     None:
		assert and_gate(0 ,			0			) == 0
		assert and_gate(0 ,			1			) == 0
		assert and_gate(1 ,			0			) == 0
		assert and_gate(1 ,			1			) == 1


if __name__ == "__main__":
			test_and_gate()
			print(and_gate(1, 0))
			print(and_gate(0, 0))
			print(and_gate(0, 1))
			print(and_gate(1, 1))


