



def A    (							__UpperCamelCase       )    ->   int:
			A__	  =     1
			for i in range(1			,						num + 1       ):
						fact *= i
			return fact


def A    (							__UpperCamelCase       )    ->   int:
			A__	  =     0
			while number > 0:
						A__	  =     number % 10
						sum_of_digits += last_digit
						A__	  =     number // 10  # Removing the last_digit from the given number
			return sum_of_digits


def A    (							__UpperCamelCase = 100       )    ->   int:
			A__	  =     factorial(__UpperCamelCase       )
			A__	  =     split_and_add(__UpperCamelCase       )
			return result


if __name__ == "__main__":
							print(solution(int(input('''Enter the Number: ''').strip())))







"""simple docstring"""




def 						A							(  snake_case__		,					snake_case__     ):




			'''simple docstring'''


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

def 						A							(  snake_case__     ):




			'''simple docstring'''


			return binomial_coefficient(2 * node_count		,					snake_case__     ) // (node_count + 1)

def 						A							(  snake_case__     ):




			'''simple docstring'''


			if n < 0:
						raise ValueError("""factorial() not defined for negative values"""     )
			SCREAMING_SNAKE_CASE__										=   1
			for i in range(1		,					n + 1     ):
						result *= i
			return result

def 						A							(  snake_case__     ):




			'''simple docstring'''


			return catalan_number(snake_case__     ) * factorial(snake_case__     )


if __name__ == "__main__":
						A_				:      Optional[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.'
						)


