



'''simple docstring'''



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

														return sequence[n]
def        UpperCAmelCase (    A	:					List[str]					):
							SCREAMING_SNAKE_CASE       :   str         =      0
							SCREAMING_SNAKE_CASE       :   List[str]         =      2

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

							return index
def        UpperCAmelCase (    A	:					List[Any] = 1000					):
							return fibonacci_digits_index(_a					)


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







def 			lowerCamelCase__			(       _a				,      _a):
	SCREAMING_SNAKE_CASE :   Optional[int]					  =							0
	while b > 0:
		if b & 1:
			res += a

		a += a
		b >>= 1

	return res

def 			lowerCamelCase__			(       _a				,      _a				,      _a):
	SCREAMING_SNAKE_CASE :   Optional[int]					  =							0
	while b > 0:
		if b & 1:
			SCREAMING_SNAKE_CASE :   Optional[Any]					  =							((res % c) + (a % c)) % c

		a += a
		b >>= 1

	return res