




'''simple docstring'''






from __future__ import annotations






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE		)    ->   float:
      if days_between_payments <= 0:
            raise ValueError('days_between_payments must be > 0'		)
      if daily_interest_rate < 0:
            raise ValueError('daily_interest_rate must be >= 0'		)
      if principal <= 0:
            raise ValueError('principal must be > 0'		)
      return principal * daily_interest_rate * days_between_payments






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE				,      )    ->   float:
      if number_of_compounding_periods <= 0:
            raise ValueError('number_of_compounding_periods must be > 0'		)
      if nominal_annual_interest_rate_percentage < 0:
            raise ValueError('nominal_annual_interest_rate_percentage must be >= 0'		)
      if principal <= 0:
            raise ValueError('principal must be > 0'		)

      return principal * (
          (1 + nominal_annual_interest_rate_percentage) ** number_of_compounding_periods
          - 1
      )






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE				,      )    ->   float:
      if number_of_years <= 0:
            raise ValueError('number_of_years must be > 0'		)
      if nominal_annual_percentage_rate < 0:
            raise ValueError('nominal_annual_percentage_rate must be >= 0'		)
      if principal <= 0:
            raise ValueError('principal must be > 0'		)

      return compound_interest(
          __SCREAMING_SNAKE_CASE				,      nominal_annual_percentage_rate / 365				,      number_of_years * 365		)


if __name__ == "__main__":
      import doctest

      doctest.testmod()






'''simple docstring'''






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE		)    ->   int:
      if n == 1 or not isinstance(__SCREAMING_SNAKE_CASE				,      __SCREAMING_SNAKE_CASE		):
            return 0
      elif n == 2:
            return 1
      else:
            snake_case__       :   int	      =    [0, 1]
            for i in range(2				,      n + 1		):
                  sequence.append(sequence[i - 1] + sequence[i - 2]		)

            return sequence[n]






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE		)    ->   int:
      snake_case__       :   Optional[int]	      =    0
      snake_case__       :   Dict	      =    2

      while digits < n:
            index += 1
            snake_case__       :   Optional[int]	      =    len(str(fibonacci(__SCREAMING_SNAKE_CASE		)		)		)

      return index






def 		UpperCamelCase__      (		__SCREAMING_SNAKE_CASE = 1000		)    ->   int:
      return fibonacci_digits_index(__SCREAMING_SNAKE_CASE		)


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