





class      UpperCamelCase_				:


							def __init__(							self			:str						)      ->      None:



									"""simple docstring"""



									SCREAMING_SNAKE_CASE__								=					[0, 1]


							def    _snake_case     (							self			:Optional[int]							, __A			:int						)      ->      list:



									"""simple docstring"""



									if (difference := index - (len(self.sequence						) - 2)) >= 1:
											for _ in range(__A						):
													self.sequence.append(self.sequence[-1] + self.sequence[-2]						)
									return self.sequence[:index]






def  SCREAMING_SNAKE_CASE__							(				):
		print(
		    """Fibonacci Series Using Dynamic Programming\n"""    ,      """Enter the index of the Fibonacci number you want to calculate """    ,      """in the prompt below. (To exit enter exit or Ctrl-C)\n"""    ,      sep=""""""    ,      )
		SCREAMING_SNAKE_CASE__								=					Fibonacci()

		while True:
				SCREAMING_SNAKE_CASE__								=					input(""">> """			)
				if prompt in {"exit", "quit"}:
						break

				try:
						SCREAMING_SNAKE_CASE__								=					int(UpperCamelCase__			)
				except ValueError:
						print("""Enter a number or 'exit'"""			)
						continue

				print(fibonacci.get(UpperCamelCase__			)			)


if __name__ == "__main__":
	main()






import math




def        lowerCAmelCase_       (							UpperCamelCase_     )   ->						bool:

       if 1 < number < 4:
              # 2 and 3 are primes
              return True
       elif number < 2 or number % 2 == 0 or number % 3 == 0:
              # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
              return False

       # All primes number are in format of 6k +/- 1
       for i in range(5    ,						int(math.sqrt(UpperCamelCase_     ) + 1     )    ,						6     ):
              if number % i == 0 or number % (i + 2) == 0:
                     return False
       return True




def        lowerCAmelCase_       (							UpperCamelCase_ = 600851475143     )   ->						int:

       try:
              UpperCamelCase_      				=     int(UpperCamelCase_     )
       except (TypeError, ValueError):
              raise TypeError("Parameter n must be int or castable to int."     )
       if n <= 0:
              raise ValueError("Parameter n must be greater than or equal to one."     )
       UpperCamelCase_      				=     0
       if is_prime(UpperCamelCase_     ):
              return n
       while n % 2 == 0:
              n //= 2
       if is_prime(UpperCamelCase_     ):
              return n
       for i in range(3    ,						int(math.sqrt(UpperCamelCase_     )     ) + 1    ,						2     ):
              if n % i == 0:
                     if is_prime(n // i     ):
                            UpperCamelCase_      				=     n // i
                            break
                     elif is_prime(UpperCamelCase_     ):
                            UpperCamelCase_      				=     i
       return max_number


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

