






def       lowercase__	(					A_:						list[list[int | float]]		)	->				int:







       """simple docstring"""






       __UpperCAmelCase     				=len(A_		)
       __UpperCAmelCase     				=len(matrix[0]		)
       __UpperCAmelCase     				=min(A_  ,      A_		)

       for row in range(A_		):
              # Check if diagonal element is not zero
              if matrix[row][row] != 0:
                     # Eliminate all the elements below the diagonal
                     for col in range(row + 1  ,      A_		):
                            __UpperCAmelCase     				=matrix[col][row] / matrix[row][row]
                            for i in range(A_  ,      A_		):
                                   matrix[col][i] -= multiplier * matrix[row][i]
              else:
                     # Find a non-zero diagonal element to swap rows
                     __UpperCAmelCase     				=True
                     for i in range(row + 1  ,      A_		):
                            if matrix[i][row] != 0:
                                   __UpperCAmelCase				, __UpperCAmelCase     				=matrix[i], matrix[row]
                                   __UpperCAmelCase     				=False
                                   break
                     if reduce:
                            rank -= 1
                            for i in range(A_		):
                                   __UpperCAmelCase     				=matrix[i][rank]

            # Reduce the row pointer by one to stay on the same row
                     row -= 1

       return rank


if __name__ == "__main__":
   import doctest

   doctest.testmod()





"""simple docstring"""




from collections.abc import Generator







def 				_UpperCAmelCase		(							):





		"""simple docstring"""




		lowerCAmelCase__ ,       lowerCAmelCase__   = 0, 1
		while True:
				lowerCAmelCase__ ,       lowerCAmelCase__   = b, a + b
				yield b







def 				_UpperCAmelCase		(							lowerCamelCase__ = 1000  ):





		"""simple docstring"""




		lowerCAmelCase__   = 1
		lowerCAmelCase__   = fibonacci_generator()
		while len(str(next(lowerCamelCase__  )  )  ) < n:
				answer += 1
		return answer + 1


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




