def recursive_fibonacci(n):
    """Returns the nth fibonacci number

    Time complexity: O(2^n)

    Parameters
    ----------
    n : int
        the nth fibonacci position

    Returns
    -------
    int
        the nth fibonacci number
    -------

    >>> recursive_fibonacci(0)
    0

    >>> recursive_fibonacci(1)
    1

    >>> recursive_fibonacci(3)
    2

    """
    if n < 0:
        raise ValueError("Value cannot be negative")
    if n == 1:
        return 1
    if n == 0:
        return 0
    return recursive_fibonacci(n - 1) + recursive_fibonacci(n - 2)