def 	__lowerCamelCase							(UpperCAmelCase__     :							Any  ):





					if n == 1 or not isinstance(A_      , A_  ):
										return 0
					elif n == 2:
										return 1
					else:
										SCREAMING_SNAKE_CASE    			=       [0, 1]
										for i in range(2      , n + 1  ):
															sequence.append(sequence[i - 1] + sequence[i - 2]  )

										return sequence[n]





def 	__lowerCamelCase							(UpperCAmelCase__     :							int  ):
					SCREAMING_SNAKE_CASE    			=       0
					SCREAMING_SNAKE_CASE    			=       2

					while digits < n:
										index += 1
										SCREAMING_SNAKE_CASE    			=       len(str(fibonacci(A_  )  )  )

					return index





def 	__lowerCamelCase							(UpperCAmelCase__     :							Optional[Any] = 1_0_0_0  ):
					return fibonacci_digits_index(A_  )


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





def 	__lowerCamelCase							(UpperCAmelCase__     :							list[int]  ):
					if not numbers:
										return 0

					if not isinstance(UpperCAmelCase__      , (list, tuple)  ) or not all(
					    isinstance(UpperCAmelCase__      , UpperCAmelCase__  ) for number in numbers  ):
										raise ValueError("numbers must be an iterable of integers"  )

					SCREAMING_SNAKE_CASE    			=       SCREAMING_SNAKE_CASE    			=       SCREAMING_SNAKE_CASE    			=       numbers[0]

					for i in range(1      , len(UpperCAmelCase__  )  ):
										# update the maximum and minimum subarray products
										SCREAMING_SNAKE_CASE    			=       numbers[i]
										if number < 0:
															SCREAMING_SNAKE_CASE			,   SCREAMING_SNAKE_CASE    			=       min_till_now, max_till_now
										SCREAMING_SNAKE_CASE    			=       max(UpperCAmelCase__      , max_till_now * number  )
										SCREAMING_SNAKE_CASE    			=       min(UpperCAmelCase__      , min_till_now * number  )

										# update the maximum product found till now
										SCREAMING_SNAKE_CASE    			=       max(UpperCAmelCase__      , UpperCAmelCase__  )

					return max_prod




