

from collections.abc import Generator





def 					__lowerCamelCase	( ):







							'''simple docstring'''






							snake_case_				,    snake_case_							=    0, 1
							while True:
														snake_case_				,    snake_case_							=    b, a + b
														yield b





def 					__lowerCamelCase	( UpperCamelCase__ = 1000      ):







							'''simple docstring'''






							snake_case_							=    1
							snake_case_							=    fibonacci_generator()
							while len(str(next(UpperCamelCase__      )      )      ) < n:
														answer += 1
							return answer + 1


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







import numpy as np





def 					__lowerCamelCase	( UpperCamelCase__      ):







							'''simple docstring'''






							return 1 / (1 + np.exp(-vector      ))





def 					__lowerCamelCase	( UpperCamelCase__      ):







							'''simple docstring'''






							return vector * sigmoid(UpperCamelCase__      )


if __name__ == "__main__":
					import doctest

					doctest.testmod()




