






from __future__ import annotations

import sys


def   _A       (    SCREAMING_SNAKE_CASE__  :     int	):
    if n < 0:
        raise ValueError('''Negative arguments are not supported'''	)
    return _fib(SCREAMING_SNAKE_CASE__	)[0]


def   _A       (    SCREAMING_SNAKE_CASE__  :     int	):
    if n == 0:  # (F(0), F(1))
        return (0, 1)

    # F(2n) = F(n)[2F(n+1) − F(n)]
    # F(2n+1) = F(n+1)^2+F(n)^2
    UpperCamelCase							,       UpperCamelCase	:Optional[Any]     							=       _fib(n // 2	)
    UpperCamelCase	:List[Any]     							=       a * (b * 2 - a)
    UpperCamelCase	:Optional[Any]     							=       a * a + b * b
    return (d, c + d) if n % 2 else (c, d)


if __name__ == "__main__":
 __snake_case							 =  int(sys.argv[1])
 print(f'''fibonacci({n}) is {fibonacci(n)}''')













def   _A       (    SCREAMING_SNAKE_CASE__  :     float					,  SCREAMING_SNAKE_CASE__  :     float	):
    UpperCamelCase	:Tuple     							=       float()
    try:
        UpperCamelCase	:Union[str, Any]     							=       mass * acceleration
    except Exception:
        return -0.0
    return force


if __name__ == "__main__":
 import doctest

 # run doctest
 doctest.testmod()

 # demo
 __snake_case							 =  1_2.5
 __snake_case							 =  10
 __snake_case							 =  newtons_second_law_of_motion(mass, acceleration)
 print("""The force is """, force, """N""")





