


"""simple docstring"""





def     lowercase__	(  lowerCamelCase     :  str				)					->     Optional[int]:
  lowerCAmelCase__    :    str								=					len(lowercase__				)
  for _ in range(
      0				,	int(((no_of_elements - 1) / 2) + 1				)				):  # we don't need to traverse to end of list as
    for j in range(0				,	no_of_elements - 1				):
      if (
          lst[j + 1] < lst[j]
      ):  # applying bubble sort algorithm from left to right (or forwards)
        lowerCAmelCase__    :    Union[str, Any]								=					lst[j + 1]
        lowerCAmelCase__    :    List[str]								=					lst[j]
        lowerCAmelCase__    :    Optional[int]								=					temp
      if (
          lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
      ):  # applying bubble sort algorithm from right to left (or backwards)
        lowerCAmelCase__    :    List[str]								=					lst[no_of_elements - 1 - j]
        lowerCAmelCase__    :    Optional[int]								=					lst[no_of_elements - 2 - j]
        lowerCAmelCase__    :    Tuple								=					temp
  return lst


if __name__ == "__main__":
   print("enter the list to be sorted")
   __UpperCAmelCase    				=      [int(x) for x in input().split()]  # inputing elements of the list in one line
   __UpperCAmelCase    				=      double_sort(lst)
   print("the sorted list is")
   print(sorted_lst)




"""simple docstring"""





def     lowercase__	(  lowerCamelCase     :  int				)					->     int:
  if not isinstance(lowerCamelCase				,	lowerCamelCase				):
    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     lowercase__	(  lowerCamelCase     :  int				)					->     int:
  if not isinstance(lowerCamelCase				,	lowerCamelCase				):
    raise TypeError("dynamic_lucas_number accepts only integer arguments."				)
  lowerCAmelCase__				,		lowerCAmelCase__    :    str								=					2, 1
  for _ in range(lowerCamelCase				):
    lowerCAmelCase__				,		lowerCAmelCase__    :    str								=					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)))
