

def 						_snake_case(    SCREAMING_SNAKE_CASE__			:	list    ,			SCREAMING_SNAKE_CASE__			:	int = 0      )							->      list:





    '''simple docstring'''






    A__          =   length or len(SCREAMING_SNAKE_CASE__      )
    A__          =   False
    for i in range(length - 1      ):
        if list_data[i] > list_data[i + 1]:
            A__      ,						A__          =   list_data[i + 1], list_data[i]
            A__          =   True

    return list_data if not swapped else bubble_sort(SCREAMING_SNAKE_CASE__    ,			length - 1      )


if __name__ == "__main__":
     import doctest

     doctest.testmod()




import os

# Precomputes a list of the 100 first triangular numbers
lowercase_       		=  [int(0.5 * n * (n + 1)) for n in range(1, 101)]
def 						_snake_case(    )							->      int:





    '''simple docstring'''






    A__          =   os.path.dirname(os.path.realpath(SCREAMING_SNAKE_CASE__      )      )
    A__          =   os.path.join(SCREAMING_SNAKE_CASE__    ,			'words.txt'      )

    A__          =   ''
    with open(SCREAMING_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(SCREAMING_SNAKE_CASE__      ) - 64 for x in word      ) for word in words]
        if word in TRIANGULAR_NUMBERS
    ]
    return len(SCREAMING_SNAKE_CASE__      )


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

