
from collections.abc import Generator


def     __lowerCAmelCase			(			)       ->  Generator[int, None, None]:
				__a							,     __a										=    0, 1
				while True:
								__a							,     __a										=    b, a + b
								yield b


def     __lowerCAmelCase			(			a__ = 1000  )       ->  int:
				__a										=    1
				__a										=    fibonacci_generator()
				while len(str(next(a__  )  )  ) < n:
								answer += 1
				return answer + 1


if __name__ == "__main__":
					print(solution(int(str(input()).strip())))


from __future__ import annotations
def      a      (			A__	:   list[int]     )    ->      int:





      """simple docstring"""



      if not nums:
            return 0
      _lowercase	       =nums[0]
      _lowercase	       =0
      for num in nums[1:]:
            _lowercase       ,       _lowercase	       =(
                max_excluding + num,
                max(A__      ,   A__     ),
            )
      return max(A__      ,   A__     )


if __name__ == "__main__":
  import doctest

  doctest.testmod()


