


def       _lowerCAmelCase    (				lowerCAmelCase_				:int		,    lowerCAmelCase_				:int				)->int:
   '''simple docstring'''






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



def       _lowerCAmelCase    (				)->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))








from math import factorial



def       _lowerCAmelCase    (				lowerCAmelCase_				:int = 20				)->int:
   '''simple docstring'''






   snake_case_            =       2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
   # 2, 3,...
   snake_case_            =       n // 2

   return int(factorial(lowerCAmelCase_				) / (factorial(lowerCAmelCase_				) * factorial(n - k				))				)


if __name__ == "__main__":
   import sys

   if len(sys.argv) == 1:
      print(solution(20))
   else:
      try:
         SCREAMING_SNAKE_CASE						:Any			=  int(sys.argv[1])
         print(solution(n))
      except ValueError:
         print('''Invalid entry - please enter a number.''')




