

import math







def       A_				(   _UpperCAmelCase    ,     _UpperCAmelCase   ):
						if 0 not in (x, y):
												# We use the relation x^y = y*log10(x), where 10 is the base.
												return y * math.logaa(_UpperCAmelCase   )
						else:
												if x == 0:  # 0 raised to any number is 0
																		return 0
												elif y == 0:
																		return 1  # any number raised to 0 is 1
						raise AssertionError("This should never happen"   )


if __name__ == "__main__":  # Main function
						# Read two numbers from input and typecast them to int using map function.
						# Here x is the base and y is the power.
						lowerCAmelCase							:  Tuple            =						"""Enter the base and the power separated by a comma: """
						lowerCAmelCase							:  Union[str, Any]            =						map(int, input(prompt).split(""","""))
						lowerCAmelCase							:  List[Any]            =						map(int, input(prompt).split(""","""))

						# We find the log of each number, using the function res(), which takes two
						# arguments.
						lowerCAmelCase							:  int            =						res(xa, ya)
						lowerCAmelCase							:  Any            =						res(xa, ya)

						# We check for the largest number
						if resa > resa:
												print("""Largest number is""", xa, """^""", ya)
						elif resa > resa:
												print("""Largest number is""", xa, """^""", ya)
						else:
												print("""Both are equal""")








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






