"""simple docstring"""
import sys

sys.set_int_max_str_digits(0)  # type: ignore







def 		__a  (      _SCREAMING_SNAKE_CASE  )      ->bool:
  a__:	Optional[Any]     				=      [0] * 11
  a__:	Tuple     				=      [0] * 11

  # mark last 9 numbers
  for _ in range(9  ):
    a__:	Union[str, Any]     				=      1
    a__:	List[Any]     				=      number // 10
  # flag
  a__:	Optional[Any]     				=      True

  # check last 9 numbers for pandigitality

  for x in range(9  ):
    if not check_last[x + 1]:
      a__:	List[Any]     				=      False
  if not f:
    return f

  # mark first 9 numbers
  a__:	Optional[int]     				=      int(str(_SCREAMING_SNAKE_CASE  )[:9]  )

  for _ in range(9  ):
    a__:	List[str]     				=      1
    a__:	List[Any]     				=      number // 10

  # check first 9 numbers for pandigitality

  for x in range(9  ):
    if not check_front[x + 1]:
      a__:	Dict     				=      False
  return f







def 		__a  (      _SCREAMING_SNAKE_CASE  )      ->bool:
  a__:	List[str]     				=      [0] * 11

  # mark last 9 numbers
  for _ in range(9  ):
    a__:	Union[str, Any]     				=      1
    a__:	List[Any]     				=      number // 10
  # flag
  a__:	str     				=      True

  # check last 9 numbers for pandigitality

  for x in range(9  ):
    if not check_last[x + 1]:
      a__:	Optional[Any]     				=      False
  return f







def 		__a  (      )      ->int:
  a__:	Optional[Any]     				=      1
  a__:	int     				=      1
  a__:	Any     				=      2
  # temporary Fibonacci numbers

  a__:	Union[str, Any]     				=      1
  a__:	Optional[Any]     				=      1
  a__:	Optional[Any]     				=      2
  # temporary Fibonacci numbers mod 1e9

  # mod m=1e9, done for fast optimisation
  a__:	Tuple     				=      [0] * 1000000
  a__:	List[Any]     				=      1000000000

  for x in range(1000000  ):
    a__:	Optional[Any]     				=      (aa + ba) % m
    a__:	Union[str, Any]     				=      ba % m
    a__:	int     				=      ca % m
    if checka(_SCREAMING_SNAKE_CASE  ):
      a__:	Optional[Any]     				=      1

  for x in range(1000000  ):
    a__:	List[str]     				=      a + b
    a__:	Union[str, Any]     				=      b
    a__:	Any     				=      c
    # perform check only if in tocheck
    if tocheck[x + 3] and check(_SCREAMING_SNAKE_CASE  ):
      return x + 3  # first 2 already done
  return -1


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



"""simple docstring"""
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  )      ->tuple[int, 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
  a__				,       a__:	Optional[int]     				=      _fib(n // 2  )
  a__:	List[str]     				=      a * (b * 2 - a)
  a__:	Dict     				=      a * a + b * b
  return (d, c + d) if n % 2 else (c, d)


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


