




'''simple docstring'''



import doctest
from collections import deque

import numpy as np







class 		lowercase_   :


			"""simple docstring"""

			def __init__(   self :     Any   ):

						"""simple docstring"""
						_SCREAMING_SNAKE_CASE	=				[2, 1, 2, -1]
						_SCREAMING_SNAKE_CASE	=				[1, 2, 3, 4]



			def 							lowerCAmelCase_      (   self :     Dict   ):

						"""simple docstring"""
						_SCREAMING_SNAKE_CASE	=				len(self.first_signal   )
						_SCREAMING_SNAKE_CASE	=				len(self.second_signal   )

						_SCREAMING_SNAKE_CASE	=				max(__lowerCamelCase  ,				__lowerCamelCase   )

						# create a zero matrix of max_length x max_length
						_SCREAMING_SNAKE_CASE	=				[[0] * max_length for i in range(__lowerCamelCase   )]

						# fills the smaller signal with zeros to make both signals of same length
						if length_first_signal < length_second_signal:
									self.first_signal += [0] * (max_length - length_first_signal)
						elif length_first_signal > length_second_signal:
									self.second_signal += [0] * (max_length - length_second_signal)
						for i in range(__lowerCamelCase   ):
									_SCREAMING_SNAKE_CASE	=				deque(self.second_signal   )
									rotated_signal.rotate(__lowerCamelCase   )
									for j, item in enumerate(__lowerCamelCase   ):
												matrix[i][j] += item

        # multiply the matrix with the first signal
						_SCREAMING_SNAKE_CASE	=				np.matmul(np.transpose(__lowerCamelCase   )  ,				np.transpose(self.first_signal   )   )

						# rounding-off to two decimal places
						return [round(__lowerCamelCase  ,				2   ) for i in final_signal]


if __name__ == "__main__":
	doctest.testmod()







'''simple docstring'''



def 			SCREAMING_SNAKE_CASE_			(							__A    :			int  )			->			int:
   if n == 1 or not isinstance(__A	,					__A  ):
      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 			SCREAMING_SNAKE_CASE_			(							__A    :			int  )			->			int:
   _SCREAMING_SNAKE_CASE	=				0
   _SCREAMING_SNAKE_CASE	=				2

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

   return index
def 			SCREAMING_SNAKE_CASE_			(							__A    :			int = 10_00  )			->			int:
   return fibonacci_digits_index(__A  )


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

