






def 		_a					(   a				:int = 4_000_000				)							->    int:

 if n <= 1:
  return 0
 a							=   0
 a							=   2
 a							=   0
 while 4 * b + a <= n:
  a						,  a							=   b, 4 * b + a
  count += a
 return count + b


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










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)))


