




"""simple docstring"""




import math







def      __UpperCAmelCase     ( __UpperCamelCase	):

			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(__UpperCamelCase	) + 1	)	,				6	):
						if number % i == 0 or number % (i + 2) == 0:
									return False
			return True







def      __UpperCAmelCase     ( __UpperCamelCase = 1_00_01	):

			try:
						__lowercase			:  Optional[int]								=       int(__UpperCamelCase	)
			except (TypeError, ValueError):
						raise TypeError('''Parameter nth must be int or castable to int.'''	) from None
			if nth <= 0:
						raise ValueError('''Parameter nth must be greater than or equal to one.'''	)
			__lowercase			:  list[int]								=       []
			__lowercase			:  Optional[int]								=       2
			while len(__UpperCamelCase	) < nth:
						if is_prime(__UpperCamelCase	):
									primes.append(__UpperCamelCase	)
									num += 1
						else:
									num += 1
			return primes[len(__UpperCamelCase	) - 1]


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





"""simple docstring"""


import os

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






def    _snake_case					(		):
	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())