






"""simple docstring"""





import os

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







def      lowerCamelCase__       (							)      ->				Tuple:
  lowerCamelCase_         =						os.path.dirname(os.path.realpath(_lowerCamelCase ) )
  lowerCamelCase_         =						os.path.join(_lowerCamelCase		,				'words.txt' )

  lowerCamelCase_         =						''
  with open(_lowerCamelCase ) as f:
    lowerCamelCase_         =						f.readline()

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


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












"""simple docstring"""





def      lowerCamelCase__       (							_lowerCamelCase       :		int		,				_lowerCamelCase       :		int )      ->				int:
  lowerCamelCase_         =						1  # To kept the Calculated Value
  # Since C(n, k) = C(n, n-k)
  if k > (n - k):
    lowerCamelCase_         =						n - k
  # Calculate C(n,k)
  for i in range(_lowerCamelCase ):
    result *= n - i
    result //= i + 1
  return result







def      lowerCamelCase__       (							_lowerCamelCase       :		int )      ->				int:
  return binomial_coefficient(2 * node_count		,				_lowerCamelCase ) // (node_count + 1)







def      lowerCamelCase__       (							_lowerCamelCase       :		int )      ->				int:
  if n < 0:
    raise ValueError('factorial() not defined for negative values' )
  lowerCamelCase_         =						1
  for i in range(1		,				n + 1 ):
    result *= i
  return result







def      lowerCamelCase__       (							_lowerCamelCase       :		int )      ->				int:
  return catalan_number(_lowerCamelCase ) * factorial(_lowerCamelCase )


if __name__ == "__main__":
  _SCREAMING_SNAKE_CASE					:				int					    =						int(input('''Enter the number of nodes: ''').strip() or 0)
  if node_count <= 0:
    raise ValueError('''We need some nodes to work with.''')
  print(
      F'''Given {node_count} nodes, there are {binary_tree_count(node_count)} '''
      F'''binary trees and {catalan_number(node_count)} binary search trees.'''
  )




