






def 					lowercase__				(					__snake_case   :							int  ):


					'''simple docstring'''


					if n == 1 or not isinstance(_a					,	_a  ):
										return 0
					elif n == 2:
										return 1
					else:
										UpperCAmelCase_   :				Any						=						[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_   :				List[Any]						=						0
					UpperCAmelCase_   :				str						=						2

					while digits < n:
										index += 1
										UpperCAmelCase_   :				Any						=						len(str(fibonacci(_a  )  )  )

					return index




def 					lowercase__				(					__snake_case   :							int = 1_000  ):


					'''simple docstring'''


					return fibonacci_digits_index(_a  )


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














def 					lowercase__				(					__snake_case   :							str					,	__snake_case   :							int					,	__snake_case   :							List[str]  ):


					'''simple docstring'''


					if n == 0:
										return 1

					elif n % 2 == 1:
										return (binary_exponentiation(__snake_case					,	n - 1					,	__snake_case  ) * a) % mod

					else:
										UpperCAmelCase_   :				Optional[int]						=						binary_exponentiation(__snake_case					,	n / 2					,	__snake_case  )
										return (b * b) % mod


# a prime number
__UpperCAmelCase     							=						701

__UpperCAmelCase     							=						1000000000
__UpperCAmelCase     							=						10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)






print((a / b) % p == (a * b ** (p - 2)) % p)






