
'''simple docstring'''







def   lowerCAmelCase(  a__    :  int      ):







       '''simple docstring'''






       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   lowerCAmelCase(  a__    :  int      ):







       '''simple docstring'''






       if not isinstance(a__      , a__      ):
              raise TypeError("dynamic_lucas_number accepts only integer arguments."      )
       lowerCamelCase__   ,		lowerCamelCase__				   =      2, 1
       for _ in range(a__      ):
              lowerCamelCase__   ,		lowerCamelCase__				   =      b, a + b
       return a


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

    testmod()
    lowerCAmelCase_      =   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)))



'''simple docstring'''







def   lowerCAmelCase(  a__    :  int = 1000      ):







       '''simple docstring'''






       lowerCamelCase__				   =      0
       for i in range(a__      ):
              if i % 3 == 0 or i % 5 == 0:
                     result += i
       return result


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

