


def 							UpperCamelCase_( lowerCamelCase_				,					lowerCamelCase_					)       ->		tuple[float, float]:

    # Check if the input is valid
    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
    _lowercase						,							_lowercase						,							_lowercase			:				Any 						=						equationa
    _lowercase						,							_lowercase						,							_lowercase			:				List[str] 						=						equationa

    # Calculate the determinants of the matrices
    _lowercase			:				Dict 						=						aa * ba - aa * ba
    _lowercase			:				Any 						=						ca * ba - ca * ba
    _lowercase			:				Optional[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:
            _lowercase			:				Optional[int] 						=						determinant_x / determinant
            _lowercase			:				Any 						=						determinant_y / determinant
            # Non-Trivial Solution (Consistent system)
            return (x, y)






def 							UpperCamelCase_( lowerCamelCase_					)       ->		int:
    if n == 1 or not isinstance(lowerCamelCase_				,					lowerCamelCase_					):
        return 0
    elif n == 2:
        return 1
    else:
        _lowercase			:				List[str] 						=						[0, 1]
        for i in range(2				,					n + 1					):
            sequence.append(sequence[i - 1] + sequence[i - 2]					)

        return sequence[n]



def 							UpperCamelCase_( lowerCamelCase_					)       ->		int:
    _lowercase			:				Tuple 						=						0
    _lowercase			:				List[str] 						=						2

    while digits < n:
        index += 1
        _lowercase			:				Optional[int] 						=						len(str(fibonacci(lowerCamelCase_					)					)					)

    return index



def 							UpperCamelCase_( lowerCamelCase_ = 1000					)       ->		int:
    return fibonacci_digits_index(lowerCamelCase_					)


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


