


'''simple docstring'''






from bisect import bisect
from itertools import accumulate


def    _snake_case  (	A					,       A					,       A					,       A			)		->       Dict:
							lowerCAmelCase__			  =      sorted(zip(A					,       A			)					,       key=lambda A			: x[0] / x[1]					,       reverse=A			)
							lowerCAmelCase__  ,   lowerCAmelCase__			  =      [i[0] for i in r], [i[1] for i in r]
							lowerCAmelCase__			  =      list(accumulate(A			)			)
							lowerCAmelCase__			  =      bisect(A					,       A			)
							return (
							    0
							    if k == 0
							    else sum(vl[:k]			) + (w - acc[k - 1]) * (vl[k]) / (wt[k])
							    if k != n
							    else sum(vl[:k]			)
							)


if __name__ == "__main__":
		import doctest

		doctest.testmod()





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


