




'''simple docstring'''



import os

# Precomputes a list of the 100 first triangular numbers
lowerCamelCase_			=						[int(0.5 * n * (n + 1)) for n in range(1, 1_01)]
def 			SCREAMING_SNAKE_CASE_			(							)			->			str:
   _SCREAMING_SNAKE_CASE	=				os.path.dirname(os.path.realpath(__A  )  )
   _SCREAMING_SNAKE_CASE	=				os.path.join(__A	,					"words.txt"  )

   _SCREAMING_SNAKE_CASE	=				""
   with open(__A  ) as f:
      _SCREAMING_SNAKE_CASE	=				f.readline()

   _SCREAMING_SNAKE_CASE	=				[word.strip("\""  ) for word in words.strip("\r\n"  ).split(","  )]
   _SCREAMING_SNAKE_CASE	=				[
       word
       for word in [sum(ord(__A  ) - 64 for x in word  ) for word in words]
       if word in TRIANGULAR_NUMBERS
   ]
   return len(__A  )


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







'''simple docstring'''



def 			SCREAMING_SNAKE_CASE_			(							__A    :			str	,					__A    :			str  )			->			str:
   _SCREAMING_SNAKE_CASE	=				len(__A  )
   _SCREAMING_SNAKE_CASE	=				len(__A  )
   _SCREAMING_SNAKE_CASE	=				(
       first_str_length if first_str_length > second_str_length else second_str_length
   )
   _SCREAMING_SNAKE_CASE	=				[]
   for char_count in range(__A  ):
      if char_count < first_str_length:
         output_list.append(first_str[char_count]  )
      if char_count < second_str_length:
         output_list.append(second_str[char_count]  )
   return "".join(__A  )


if __name__ == "__main__":
 print(alternative_string_arrange('AB', 'XYZ'), end=' ')

