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




def 							__SCREAMING_SNAKE_CASE   (		)     ->						None:
				assert nand_gate(0    ,							0			) == 1
				assert nand_gate(0    ,							1			) == 1
				assert nand_gate(1    ,							0			) == 1
				assert nand_gate(1    ,							1			) == 0


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






'''simple docstring'''

def      UpperCamelCase_						(					snake_case_       :       Union[str, Any]=2_81_23      )					->     str:






 '''simple docstring'''

 __lowerCAmelCase											=						[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											=						set()
 __lowerCAmelCase											=						0

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

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

 return res


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






