


'''simple docstring'''



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

										return sequence[n]






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE      :   int   ):
					__a			:       Tuple					    =  0
					__a			:       Union[str, Any]					    =  2

					while digits < n:
										index += 1
										__a			:       Tuple					    =  len(str(fibonacci(_SCREAMING_SNAKE_CASE   )   )   )

					return index






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE      :   int = 1_000   ):
					return fibonacci_digits_index(_SCREAMING_SNAKE_CASE   )


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







'''simple docstring'''

import math





def __snake_case					(      UpperCAmelCase_						:						int		):
 lowerCamelCase_      =  math.loga(math.sqrt(4 * positive_integer + 1		) / 2 + 1 / 2		)

 return exponent == int(UpperCAmelCase_		)





def __snake_case					(      UpperCAmelCase_						:						float = 1 / 12345		):
 lowerCamelCase_      =  0
 lowerCamelCase_      =  0

 lowerCamelCase_      =  3
 while True:
  lowerCamelCase_      =  (integer**2 - 1) / 4
  # if candidate is an integer, then there is a partition for k
  if partition_candidate == int(UpperCAmelCase_		):
   lowerCamelCase_      =  int(UpperCAmelCase_		)
   total_partitions += 1
   if check_partition_perfect(UpperCAmelCase_		):
    perfect_partitions += 1
  if perfect_partitions > 0:
   if perfect_partitions / total_partitions < max_proportion:
    return int(UpperCAmelCase_		)
  integer += 1


if __name__ == "__main__":
     print(f'''{solution() = }''')



