

def       A_				(   _UpperCAmelCase   ):
						SCREAMING_SNAKE_CASE_:			List[str]  		=	int(_UpperCAmelCase   )
						if decimal in (0, 1):  # Exit cases for the recursion
												return str(_UpperCAmelCase   )
						SCREAMING_SNAKE_CASE_		,   SCREAMING_SNAKE_CASE_:			Union[str, Any]  		=	divmod(_UpperCAmelCase    ,     2   )
						return binary_recursive(_UpperCAmelCase   ) + str(_UpperCAmelCase   )







def       A_				(   _UpperCAmelCase   ):
						SCREAMING_SNAKE_CASE_:			Tuple  		=	str(_UpperCAmelCase   ).strip()
						if not number:
												raise ValueError("No input value was provided"   )
						SCREAMING_SNAKE_CASE_:			Union[str, Any]  		=	"-" if number.startswith("-"   ) else ""
						SCREAMING_SNAKE_CASE_:			Optional[int]  		=	number.lstrip("-"   )
						if not number.isnumeric():
												raise ValueError("Input value is not an integer"   )
						return f"{negative}0b{binary_recursive(int(_UpperCAmelCase   )   )}"


if __name__ == "__main__":
						from doctest import testmod

						testmod()









import os

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







def       A_				(   ):
						SCREAMING_SNAKE_CASE_:			List[str]  		=	os.path.dirname(os.path.realpath(_UpperCAmelCase   )   )
						SCREAMING_SNAKE_CASE_:			Union[str, Any]  		=	os.path.join(_UpperCAmelCase    ,     "words.txt"   )

						SCREAMING_SNAKE_CASE_:			Dict  		=	""
						with open(_UpperCAmelCase   ) as f:
												SCREAMING_SNAKE_CASE_:			int  		=	f.readline()

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


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






