






def      lowercase__      (     __snake_case    :							int     ,       __snake_case    :							int  ):


					'''simple docstring'''


					if a < 0 or b < 0:
										raise ValueError('the value of both inputs must be positive'  )

					UpperCAmelCase_    :      Tuple            =						str(bin(__snake_case  )  )[2:]  # remove the leading "0b"
					UpperCAmelCase_    :      Union[str, Any]            =						str(bin(__snake_case  )  )[2:]  # remove the leading "0b"

					UpperCAmelCase_    :      List[Any]            =						max(len(__snake_case  )     ,       len(__snake_case  )  )

					return "0b" + "".join(
					    str(int(char_a == '1' and char_b == '1'  )  )
					    for char_a, char_b in zip(a_binary.zfill(__snake_case  )     ,       b_binary.zfill(__snake_case  )  )  )


if __name__ == "__main__":
		import doctest

		doctest.testmod()














import os

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




def      lowercase__      (     ):


					'''simple docstring'''


					UpperCAmelCase_    :      Any            =						os.path.dirname(os.path.realpath(__snake_case  )  )
					UpperCAmelCase_    :      Optional[Any]            =						os.path.join(__snake_case     ,       'words.txt'  )

					UpperCAmelCase_    :      Union[str, Any]            =						''
					with open(__snake_case  ) as f:
										UpperCAmelCase_    :      List[Any]            =						f.readline()

					UpperCAmelCase_    :      Optional[int]            =						[word.strip('"'  ) for word in words.strip('\r\n'  ).split(','  )]
					UpperCAmelCase_    :      Optional[int]            =						[
					    word
					    for word in [sum(ord(__snake_case  ) - 64 for x in word  ) for word in words]
					    if word in TRIANGULAR_NUMBERS
					]
					return len(__snake_case  )


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






