def fib_rec(n):
    """
    Recursive solution.

    Warning:
    The call stack grows exponentially as 'n' increase.
    Do not use the recursive solution beyond n = 20.
    """
    if n < 3:
        return 1
    return fib_rec(n-1) + fib_rec(n-2)