


"""simple docstring"""






import os

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






     """simple docstring"""

     _a					= os.path.dirname(os.path.realpath(snake_case__				)				)
     _a					= os.path.join(snake_case__,   '''words.txt'''				)

     _a					= ''''''
     with open(snake_case__				) as f:
          _a					= f.readline()

     _a					= [word.strip('''"'''				) for word in words.strip('''\r\n'''				).split(''','''				)]
     _a					= [
         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())

import itertools
import math




def 				a						(							snake_case__:					int					):


				'''simple docstring'''

				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5						,   int(math.sqrt(snake_case__					) + 1					)						,   6					):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True




def 				a						(							):


				'''simple docstring'''
				lowercase_       =					2
				while True:
								if is_prime(snake_case__					):
												yield num
								num += 1




def 				a						(							snake_case__:					int = 10_001					):


				'''simple docstring'''
				return next(itertools.islice(prime_generator()						,   nth - 1						,   snake_case__					)					)


if __name__ == "__main__":
						print(f"{solution() = }")




