
"""simple docstring"""




import requests

UpperCAmelCase__      :    Optional[Any]    							= 'YOUR API KEY'

def lowercase_  (   _snake_case   ,_snake_case = giphy_api_key						):
							SCREAMING_SNAKE_CASE__						:       Tuple           =   """+""".join(query.split()						)
							SCREAMING_SNAKE_CASE__						:       Optional[int]           =   f'''https://api.giphy.com/v1/gifs/search?q={formatted_query}&api_key={api_key}'''
							SCREAMING_SNAKE_CASE__						:       List[Any]           =   requests.get(_snake_case						).json()["""data"""]
							return [gif["url"] for gif in gifs]


if __name__ == "__main__":
					print('\n'.join(get_gifs('space ship')))












"""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.'''
  )




