
def 	UpperCamelCase__  (     SCREAMING_SNAKE_CASE_	:	int		,   SCREAMING_SNAKE_CASE_	:	int       )  ->     int:
						return int((input_a, input_a).count(1       ) != 0       )




def 	UpperCamelCase__  (     )  ->     None:
						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))

import os

# Precomputes a list of the 100 first triangular numbers
A		: List[Any]								=     [int(0.5 * n * (n + 1)) for n in range(1, 101)]




def 	UpperCamelCase__  (     )  ->     str:
						_lowercase					       =					os.path.dirname(os.path.realpath(SCREAMING_SNAKE_CASE_       )       )
						_lowercase					       =					os.path.join(SCREAMING_SNAKE_CASE_		,   """words.txt"""       )

						_lowercase					       =					""""""
						with open(SCREAMING_SNAKE_CASE_       ) as f:
												_lowercase					       =					f.readline()

						_lowercase					       =					[word.strip("""\""""       ) for word in words.strip("""\r\n"""       ).split(""","""       )]
						_lowercase					       =					[
						    word
						    for word in [sum(ord(SCREAMING_SNAKE_CASE_       ) - 64 for x in word       ) for word in words]
						    if word in TRIANGULAR_NUMBERS
						]
						return len(SCREAMING_SNAKE_CASE_       )


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