




def 			a   (_lowerCAmelCase     ):
							if n == 1 or not isinstance(_lowerCAmelCase  ,    _lowerCAmelCase     ):
														return 0
							elif n == 2:
														return 1
							else:
														SCREAMING_SNAKE_CASE_   	=    [0, 1]
														for i in range(2  ,    n + 1     ):
																					sequence.append(sequence[i - 1] + sequence[i - 2]     )

														return sequence[n]

def 			a   (_lowerCAmelCase     ):
							SCREAMING_SNAKE_CASE_   	=    0
							SCREAMING_SNAKE_CASE_   	=    2

							while digits < n:
														index += 1
														SCREAMING_SNAKE_CASE_   	=    len(str(fibonacci(_lowerCAmelCase     )     )     )

							return index

def 			a   (_lowerCAmelCase = 1_0_0_0     ):
							return fibonacci_digits_index(_lowerCAmelCase     )


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






def 			a   (_lowerCAmelCase     ):
							if number > 0:
														raise ValueError('''input must be a negative integer'''     )
							SCREAMING_SNAKE_CASE_   	=    len(bin(_lowerCAmelCase     )[3:]     )
							SCREAMING_SNAKE_CASE_   	=    bin(abs(_lowerCAmelCase     ) - (1 << binary_number_length)     )[3:]
							SCREAMING_SNAKE_CASE_   	=    (
							    (
							        '''1'''
							        + '''0''' * (binary_number_length - len(_lowerCAmelCase     ))
							        + twos_complement_number
							    )
							    if number < 0
							    else '''0'''
							)
							return "0b" + twos_complement_number


if __name__ == "__main__":
			import doctest

			doctest.testmod()


