






import os

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




def 				A		(					)		-> Optional[Any]:
	UpperCamelCase__ :Optional[int]						=      os.path.dirname(os.path.realpath(lowercase__  )  )
	UpperCamelCase__ :Optional[Any]						=      os.path.join(lowercase__ ,		"""words.txt"""  )

	UpperCamelCase__ :Optional[Any]						=      """"""
	with open(lowercase__  ) as f:
		UpperCamelCase__ :int						=      f.readline()

	UpperCamelCase__ :Optional[int]						=      [word.strip("""\""""  ) for word in words.strip("""\r\n"""  ).split(""","""  )]
	UpperCamelCase__ :Union[str, Any]						=      [
	    word
	    for word in [sum(ord(lowercase__  ) - 64 for x in word  ) for word in words]
	    if word in TRIANGULAR_NUMBERS
	]
	return len(lowercase__  )


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






def      UpperCAmelCase_    (    _UpperCAmelCase							:list				)	->				list:
     '''simple docstring'''


     if len(_UpperCAmelCase				) < 2:
          return collection

     def circle_sort_util(_UpperCAmelCase							:list  ,						_UpperCAmelCase							:int  ,						_UpperCAmelCase							:int				) -> bool:
          A_          =       False

          if low == high:
               return swapped

          A_          =       low
          A_          =       high

          while left < right:
               if collection[left] > collection[right]:
                    A_   ,    A_          =       (
                        collection[right],
                        collection[left],
                    )
                    A_          =       True

               left += 1
               right -= 1

          if left == right and collection[left] > collection[right + 1]:
               A_   ,    A_          =       (
                   collection[right + 1],
                   collection[left],
               )

               A_          =       True

          A_          =       low + int((high - low) / 2				)
          A_          =       circle_sort_util(_UpperCAmelCase  ,						_UpperCAmelCase  ,						_UpperCAmelCase				)
          A_          =       circle_sort_util(_UpperCAmelCase  ,						mid + 1  ,						_UpperCAmelCase				)

          return swapped or left_swap or right_swap

     A_          =       True

     while is_not_sorted is True:
          A_          =       circle_sort_util(_UpperCAmelCase  ,						0  ,						len(_UpperCAmelCase				) - 1				)

     return collection


if __name__ == "__main__":
      a__      :     Optional[Any]         =		input('Enter numbers separated by a comma:\n').strip()
      a__      :     List[str]         =		[int(item) for item in user_input.split(',')]
      print(circle_sort(unsorted))



