



'''simple docstring'''





import math




def lowerCAmelCase    (__A):



     """simple docstring"""



     _a           =    math.loga(math.sqrt(4 * positive_integer + 1) / 2 + 1 / 2)

     return exponent == int(__A)




def lowerCAmelCase    (__A = 1 / 12_345):



     """simple docstring"""



     _a           =    0
     _a           =    0

     _a           =    3
     while True:
          _a           =    (integer**2 - 1) / 4
          # if candidate is an integer, then there is a partition for k
          if partition_candidate == int(__A):
               _a           =    int(__A)
               total_partitions += 1
               if check_partition_perfect(__A):
                    perfect_partitions += 1
          if perfect_partitions > 0:
               if perfect_partitions / total_partitions < max_proportion:
                    return int(__A)
          integer += 1


if __name__ == "__main__":
  print(F"""{solution() = }""")





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())




