






from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


lowerCamelCase	:							List[Any]				={
    '''configuration_luke''': ['''LUKE_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''LukeConfig'''],
    '''tokenization_luke''': ['''LukeTokenizer'''],
}

try:
 if not is_torch_available():
  raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
 pass
else:
 lowerCamelCase	:							List[Any]				=[
     '''LUKE_PRETRAINED_MODEL_ARCHIVE_LIST''',
     '''LukeForEntityClassification''',
     '''LukeForEntityPairClassification''',
     '''LukeForEntitySpanClassification''',
     '''LukeForMultipleChoice''',
     '''LukeForQuestionAnswering''',
     '''LukeForSequenceClassification''',
     '''LukeForTokenClassification''',
     '''LukeForMaskedLM''',
     '''LukeModel''',
     '''LukePreTrainedModel''',
 ]


if TYPE_CHECKING:
 from .configuration_luke import LUKE_PRETRAINED_CONFIG_ARCHIVE_MAP, LukeConfig
 from .tokenization_luke import LukeTokenizer

 try:
  if not is_torch_available():
   raise OptionalDependencyNotAvailable()
 except OptionalDependencyNotAvailable:
  pass
 else:
  from .modeling_luke import (
      LUKE_PRETRAINED_MODEL_ARCHIVE_LIST,
      LukeForEntityClassification,
      LukeForEntityPairClassification,
      LukeForEntitySpanClassification,
      LukeForMaskedLM,
      LukeForMultipleChoice,
      LukeForQuestionAnswering,
      LukeForSequenceClassification,
      LukeForTokenClassification,
      LukeModel,
      LukePreTrainedModel,
  )

else:
 import sys

 lowerCamelCase	:							int				=_LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)



'''simple docstring'''
def 			a      (			__a   )  ->	"list[int]":



					'''simple docstring'''






					if upper_limit < 0:
										raise ValueError('''Limit for the Catalan sequence must be ≥ 0'''   )

					UpperCamelCase__   :Optional[Any]												= [0] * (upper_limit + 1)

					# Base case: C(0) = C(1) = 1
					UpperCamelCase__   :int												= 1
					if upper_limit > 0:
										UpperCamelCase__   :int												= 1

					# Recurrence relation: C(i) = sum(C(j).C(i-j-1)), from j = 0 to i
					for i in range(2 ,					upper_limit + 1   ):
										for j in range(__a   ):
															catalan_list[i] += catalan_list[j] * catalan_list[i - j - 1]

					return catalan_list


if __name__ == "__main__":
		print('''\n********* Catalan Numbers Using Dynamic Programming ************\n''')
		print('''\n*** Enter -1 at any time to quit ***''')
		print('''\nEnter the upper limit (≥ 0) for the Catalan number sequence: ''', end='''''')
		try:
				while True:
						__snake_case							      =     int(input().strip())
						if N < 0:
								print('''\n********* Goodbye!! ************''')
								break
						else:
								print(F"""The Catalan numbers from 0 through {N} are:""")
								print(catalan_numbers(N))
								print('''Try another upper limit for the sequence: ''', end='''''')
		except (NameError, ValueError):
				print('''\n********* Invalid input, goodbye! ************\n''')

		import doctest

		doctest.testmod()