






def      lowercase__      (     __snake_case    :							int  ):


					'''simple docstring'''


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

										return sequence[n]




def      lowercase__      (     __snake_case    :							int  ):


					'''simple docstring'''


					UpperCAmelCase_    :      int            =						0
					UpperCAmelCase_    :      Any            =						2

					while digits < n:
										index += 1
										UpperCAmelCase_    :      Tuple            =						len(str(fibonacci(__snake_case  )  )  )

					return index




def      lowercase__      (     __snake_case    :							int = 1_000  ):


					'''simple docstring'''


					return fibonacci_digits_index(__snake_case  )


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












def 	_a      (						SCREAMING_SNAKE_CASE_							:				int = 1_00_00_00     ):
					__lowerCAmelCase				   =       [i - 1 for i in range(limit + 1     )]

					for i in range(2      ,      limit + 1     ):
										if phi[i] == i - 1:
															for j in range(2 * i      ,      limit + 1      ,      SCREAMING_SNAKE_CASE_     ):
																				phi[j] -= phi[j] // i

					return sum(phi[2 : limit + 1]     )


if __name__ == "__main__":
					print(solution())




