





from itertools import permutations

def 				SCREAMING_SNAKE_CASE__							(	snake_case__	:tuple  )   ->    bool:
  if num[3] % 2 != 0:
    return False

  if (num[2] + num[3] + num[4]) % 3 != 0:
    return False

  if num[5] % 5 != 0:
    return False

  _lowercase						    =			[7, 11, 13, 17]
  for i, test in enumerate(snake_case__  ):
    if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
      return False
  return True

def 				SCREAMING_SNAKE_CASE__							(	snake_case__	:int = 10  )   ->    int:
  return sum(
      int(''.join(map(snake_case__      ,				snake_case__  )  )  )
      for num in permutations(range(snake_case__  )  )
      if is_substring_divisible(snake_case__  )  )


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





def SCREAMING_SNAKE_CASE							(			lowercase_					,							lowercase_		)  ->			int:



       """simple docstring"""

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







def SCREAMING_SNAKE_CASE							(			)  ->			None:



       """simple docstring"""

       assert or_gate(0					,							0		) == 0
       assert or_gate(0					,							1		) == 1
       assert or_gate(1					,							0		) == 1
       assert or_gate(1					,							1		) == 1


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


