




from __future__ import annotations





def 						__A						(      __lowerCamelCase				,     __lowerCamelCase       ) ->			Optional[int]:
	# Checks if the entire collection has been sorted
	if len(lowerCAmelCase_       ) <= 1 or n <= 1:
		return

	insert_next(lowerCAmelCase_				,     n - 1       )
	rec_insertion_sort(lowerCAmelCase_				,     n - 1       )





def 						__A						(      __lowerCamelCase				,     __lowerCamelCase       ) ->			Dict:
	# Checks order between adjacent elements
	if index >= len(lowerCAmelCase_       ) or collection[index - 1] <= collection[index]:
		return

	# Swaps adjacent elements since they are not in ascending order
	a							,					a									=				(
	    collection[index],
	    collection[index - 1],
	)

	insert_next(lowerCAmelCase_				,     index + 1       )


if __name__ == "__main__":
		__UpperCamelCase   :			Optional[Any]          = input("Enter integers separated by spaces: ")
		__UpperCamelCase   :			Tuple          = [int(num) for num in numbers.split()]
		rec_insertion_sort(number_list, len(number_list))
		print(number_list)





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

      return sequence[n]
def 	_UpperCamelCase					(    lowerCAmelCase_ )    ->int:
   UpperCAmelCase      					=  0
   UpperCAmelCase      					=  2

   while digits < n:
      index += 1
      UpperCAmelCase      					=  len(str(fibonacci(lowerCAmelCase_ ) ) )

   return index
def 	_UpperCamelCase					(    lowerCAmelCase_ = 1_0_0_0 )    ->int:
   return fibonacci_digits_index(lowerCAmelCase_ )


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



