



'''simple docstring'''


def  UpperCAmelCase_       (		lowercase__       ,	lowercase__       ):


					'''simple docstring'''







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






def  UpperCAmelCase_       (		):


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







'''simple docstring'''


import os

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






def  UpperCAmelCase_       (		):


     '''simple docstring'''







     a_       		=os.path.dirname(os.path.realpath(lowercase__       )       )
     a_       		=os.path.join(lowercase__       ,	"words.txt"       )

     a_       		=""
     with open(lowercase__       ) as f:
          a_       		=f.readline()

     a_       		=[word.strip("\""       ) for word in words.strip("\r\n"       ).split(","       )]
     a_       		=[
         word
         for word in [sum(ord(lowercase__       ) - 6_4 for x in word       ) for word in words]
         if word in TRIANGULAR_NUMBERS
     ]
     return len(lowercase__       )


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


