import os

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




def        lowerCAmelCase_			(					)					->    List[Any]:







      '''simple docstring'''


      UpperCAmelCase__								=  os.path.dirname(os.path.realpath(lowercase_							)							)
      UpperCAmelCase__								=  os.path.join(lowercase_,  "words.txt"							)

      UpperCAmelCase__								=  ""
      with open(lowercase_							) as f:
            UpperCAmelCase__								=  f.readline()

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

from __future__ import annotations




def        lowerCAmelCase_			(					__A							)					->    list[int]:







      '''simple docstring'''


      if len(__A							) == 0:
            return array

      UpperCAmelCase__		,				UpperCAmelCase__								=  min(__A							), max(__A							)

      # Compute the variables
      UpperCAmelCase__								=  _max - _min + 1
      UpperCAmelCase__		,				UpperCAmelCase__								=  [0] * holes_range, [0] * holes_range

      # Make the sorting.
      for i in array:
            UpperCAmelCase__								=  i - _min
            UpperCAmelCase__								=  i
            holes_repeat[index] += 1

      # Makes the array back by replacing the numbers.
      UpperCAmelCase__								=  0
      for i in range(__A							):
            while holes_repeat[i] > 0:
                  UpperCAmelCase__								=  holes[i]
                  index += 1
                  holes_repeat[i] -= 1

    # Returns the sorted array.
      return array


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      UpperCamelCase__    							= input('Enter numbers separated by comma:\n')
      UpperCamelCase__    							= [int(x) for x in user_input.split(',')]
      print(pigeon_sort(unsorted))



