






from __future__ import annotations

from fractions import Fraction





def 					snake_case	(  lowerCamelCase					,	lowerCamelCase       ):




	'''simple docstring'''







	return (
	    num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
	)





def 					snake_case	(  lowerCamelCase       ):




	'''simple docstring'''







	__lowercase   							=	[]
	__lowercase   							=	11
	__lowercase   							=	int("""1""" + """0""" * digit_len       )
	for num in range(lowerCamelCase					,	lowerCamelCase       ):
		while den <= 99:
			if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
				if is_digit_cancelling(lowerCamelCase					,	lowerCamelCase       ):
					solutions.append(F'{num}/{den}'       )
			den += 1
		num += 1
		__lowercase   							=	10
	return solutions





def 					snake_case	(  lowerCamelCase = 2       ):




	'''simple docstring'''







	__lowercase   							=	1.0
	for fraction in fraction_list(lowerCamelCase       ):
		__lowercase   							=	Fraction(lowerCamelCase       )
		result *= frac.denominator / frac.numerator
	return int(lowerCamelCase       )


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



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