82b1027c08effb74940b0d4786374d72475528f5bdbdd188258609a7a117b00d

```python
def fibonacci_recursive(n):
    """
    Calculates the nth Fibonacci number using recursion.
    """
    if n <= 0:
        return 0
    elif n == 1:
        return 1
    else:
        # Recursive step: F(n) = F(n-1) + F(n-2)
        return fibonacci_recursive(n - 1) + fibonacci_recursive(n - 2)

# Example usage:
number = 8
result = fibonacci_recursive(number)
print(f"The {number}th Fibonacci number is: {result}")  # Output: The 8th Fibonacci number is: 21

number = 0
result = fibonacci_recursive(number)
print(f"The {number}th Fibonacci number is: {result}")  # Output: The 0th Fibonacci number is: 0
```