






def 		_a					(   a				:Dict			,							a				:Optional[int]				)							->    str:
 sequence.append(__a				)

 a							=   0
 while sequence[index] != target:
  index += 1

 sequence.pop()

 if index == len(__a				):
  return None

 return index


if __name__ == "__main__":
    UpperCAmelCase__            =	input("Enter numbers separated by comma:\n").strip()
    UpperCAmelCase__            =	[int(item) for item in user_input.split(",")]

    UpperCAmelCase__            =	input("Enter a single number to be found in the list:\n")
    UpperCAmelCase__            =	int(target_input)
    UpperCAmelCase__            =	sentinel_linear_search(sequence, target)
    if result is not None:
        print(f"""{target} found at positions: {result}""")
    else:
        print("Not found")










def 		_a					(   a				:int				)							->    int:
 if not isinstance(a			,							a				):
  raise TypeError('''recursive_lucas_number accepts only integer arguments.'''				)
 if n_th_number == 0:
  return 2
 if n_th_number == 1:
  return 1

 return recursive_lucas_number(n_th_number - 1				) + recursive_lucas_number(
     n_th_number - 2				)
def 		_a					(   a				:int				)							->    int:
 if not isinstance(a			,							a				):
  raise TypeError('''dynamic_lucas_number accepts only integer arguments.'''				)
 a						,  a							=   2, 1
 for _ in range(a				):
  a						,  a							=   b, a + b
 return a


if __name__ == "__main__":
     from doctest import testmod

     testmod()
     UpperCAmelCase__            =	int(input("Enter the number of terms in lucas series:\n").strip())
     print("Using recursive function to calculate lucas series:")
     print(" ".join(str(recursive_lucas_number(i)) for i in range(n)))
     print("\nUsing dynamic function to calculate lucas series:")
     print(" ".join(str(dynamic_lucas_number(i)) for i in range(n)))


