Solve in Python:
# Task:
Write a function that accepts an integer `n` and returns **the sum of the factorials of the first **`n`** Fibonacci numbers**

## Examples:

```python
sum_fib(2)  = 2    # 0! + 1! = 2
sum_fib(3)  = 3    # 0! + 1! + 1! = 3
sum_fib(4)  = 5    # 0! + 1! + 1! + 2! = 5
sum_fib(10) = 295232799039604140898709551821456501251
```

### Constraints:

* #### **2 ≤ N ≤ 22**

### sum_fib(20)

This number is so huge I need to make a separate area for it. Imagine 13327...
from math import factorial

def sum_fib(n):
    fibo_num = 1
    fibo_num_prev = 0
    sum_factorial = 0
    for num in range(0,n):
        sum_factorial = sum_factorial + factorial(fibo_num_prev)
        fibo_num_prev, fibo_num = fibo_num, fibo_num + fibo_num_prev
    return sum_factorial