





'''simple docstring'''






def        UpperCamelCase__		(						__magic_name__  :   int      )				->			int:
 '''simple docstring'''






 if n == 1 or not isinstance(__magic_name__		,       __magic_name__      ):
  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__		(						__magic_name__  :   int      )				->			int:
 '''simple docstring'''






 snake_case__     :					List[Any]    =  0
 snake_case__     :					str    =  2

 while digits < n:
  index += 1
  snake_case__     :					List[Any]    =  len(str(fibonacci(__magic_name__      )      )      )

 return index



def        UpperCamelCase__		(						__magic_name__  :   int = 10_00      )				->			int:
 '''simple docstring'''






 return fibonacci_digits_index(__magic_name__      )


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








UpperCAmelCase   :    Any     =		[0, 2, 4, 6, 8]
UpperCAmelCase   :    Optional[Any]     =		[1, 3, 5, 7, 9]






def 	__lowerCamelCase						(							lowerCamelCase__		:						int  ,							lowerCamelCase__		:						int  ,							lowerCamelCase__		:						list[int]  ,							lowerCamelCase__		:						int      ):





			'''simple docstring'''




			if remaining_length == 0:
						if digits[0] == 0 or digits[-1] == 0:
									return 0

						for i in range(length // 2 - 1  ,							-1  ,							-1      ):
									remainder += digits[i] + digits[length - i - 1]

									if remainder % 2 == 0:
												return 0

									remainder //= 10

						return 1

			if remaining_length == 1:
						if remainder % 2 == 0:
									return 0

						lowerCamelCase    		=  0
						for digit in range(10      ):
									lowerCamelCase    		=  digit
									result += reversible_numbers(
									    0  ,							(remainder + 2 * digit) // 10  ,							lowerCamelCase__  ,							lowerCamelCase__      )
						return result

			lowerCamelCase    		=  0
			for digita in range(10      ):
						lowerCamelCase    		=  digita

						if (remainder + digita) % 2 == 0:
									lowerCamelCase    		=  ODD_DIGITS
						else:
									lowerCamelCase    		=  EVEN_DIGITS

						for digita in other_parity_digits:
									lowerCamelCase    		=  digita
									result += reversible_numbers(
									    remaining_length - 2  ,							(remainder + digita + digita) // 10  ,							lowerCamelCase__  ,							lowerCamelCase__  ,							)
			return result






def 	__lowerCamelCase						(							lowerCamelCase__		:						int = 9      ):





			'''simple docstring'''




			lowerCamelCase    		=  0
			for length in range(1  ,							max_power + 1      ):
						result += reversible_numbers(lowerCamelCase__  ,							0  ,							[0] * length  ,							lowerCamelCase__      )
			return result


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

