

"""simple docstring"""





def   _A  (  UpperCamelCase_     :       int,			UpperCamelCase_     :       int)	->						int:
   '''simple docstring'''


   return int((input_a, input_a).count(0) == 0)




def   _A  (  )	->						None:
   '''simple docstring'''


   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))








def 		lowercase_(  SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  if divisor % 5 == 0 or divisor % 2 == 0:
    return 0
  lowerCamelCase :					List[Any]    =				1
  lowerCamelCase :					Union[str, Any]    =				1
  while repunit:
    lowerCamelCase :					Union[str, Any]    =				(10 * repunit + 1) % divisor
    repunit_index += 1
  return repunit_index






def 		lowercase_(  SCREAMING_SNAKE_CASE_ = 1000000	):


  '''simple docstring'''

  lowerCamelCase :					List[str]    =				limit - 1
  if divisor % 2 == 0:
    divisor += 1
  while least_divisible_repunit(SCREAMING_SNAKE_CASE_	) <= limit:
    divisor += 2
  return divisor


if __name__ == "__main__":
   print(f'''{solution() = }''')



