
import math




def 							a		(				snake_case__:   int   ):


				'''simple docstring'''
				assert isinstance(snake_case__		,  snake_case__   ) and (
				    number >= 0
				), "'number' must been an int and positive"

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

				lowercase_	    =   range(3		,  int(math.sqrt(snake_case__   ) + 1   )		,  2   )
				return not any(not number % i for i in odd_numbers   )




def 							a		(				snake_case__:   List[Any]		,  snake_case__:   Optional[Any]=1		,  **snake_case__:   str   ):


				'''simple docstring'''
				lowercase_	    =   factor * value
				lowercase_	    =   value

				while not is_prime(snake_case__   ):
								value += 1 if not ("desc" in kwargs and kwargs["desc"] is True) else -1

				if value == first_value_val:
								return next_prime(value + 1		,  **snake_case__   )
				return value






import os

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




def 							a		(				):


				'''simple docstring'''
				lowercase_	    =   os.path.dirname(os.path.realpath(snake_case__   )   )
				lowercase_	    =   os.path.join(snake_case__		,  '''words.txt'''   )

				lowercase_	    =   ''''''
				with open(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(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())




