a12e40050fec8346a748f0a4f9f0713341e61f847beb670652620835cb24ca98

```python
def fibonacci_recursive(n):
    """
    Calculates the n-th 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 8-th Fibonacci number is: 21
```