





def    _a    (							lowerCAmelCase_			,      lowerCAmelCase_	):





      """simple docstring"""



      if not len(lowerCAmelCase_	) == len(lowerCAmelCase_	) == 3:
            raise ValueError('''Please enter a valid equation.'''	)
      if equationa[0] == equationa[1] == equationa[0] == equationa[1] == 0:
            raise ValueError('''Both a & b of two equations can\'t be zero.'''	)

      # Extract the coefficients
      _snake_case		:	Optional[Any]					     =     equationa
      _snake_case		:	Tuple					     =     equationa

      # Calculate the determinants of the matrices
      _snake_case		:	List[Any]					     =     aa * ba - aa * ba
      _snake_case		:	Dict					     =     ca * ba - ca * ba
      _snake_case		:	int					     =     aa * ca - aa * ca

      # Check if the system of linear equations has a solution (using Cramer's rule)
      if determinant == 0:
            if determinant_x == determinant_y == 0:
                  raise ValueError('''Infinite solutions. (Consistent system)'''	)
            else:
                  raise ValueError('''No solution. (Inconsistent system)'''	)
      else:
            if determinant_x == determinant_y == 0:
                  # Trivial solution (Inconsistent system)
                  return (0.0, 0.0)
            else:
                  _snake_case		:	Optional[int]					     =     determinant_x / determinant
                  _snake_case		:	Optional[Any]					     =     determinant_y / determinant
                  # Non-Trivial Solution (Consistent system)
                  return (x, y)









'''simple docstring'''

from collections.abc import Generator




def    _a    (							):





      """simple docstring"""



      _snake_case     ,							_snake_case		:	Union[str, Any]					     =     0, 1
      while True:
            _snake_case     ,							_snake_case		:	List[str]					     =     b, a + b
            yield b




def    _a    (							lowerCAmelCase_ = 1_000	):





      """simple docstring"""



      _snake_case		:	List[str]					     =     1
      _snake_case		:	Dict					     =     fibonacci_generator()
      while len(str(next(lowerCAmelCase_	)	)	) < n:
            answer += 1
      return answer + 1


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


